咨询与建议

限定检索结果

文献类型

  • 230 篇 期刊文献
  • 64 篇 会议
  • 2 篇 学位论文
  • 1 册 图书

馆藏范围

  • 297 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 208 篇 工学
    • 177 篇 计算机科学与技术...
    • 35 篇 软件工程
    • 21 篇 电气工程
    • 9 篇 信息与通信工程
    • 8 篇 交通运输工程
    • 5 篇 电子科学与技术(可...
    • 5 篇 控制科学与工程
    • 4 篇 机械工程
    • 3 篇 土木工程
    • 3 篇 生物医学工程(可授...
    • 2 篇 核科学与技术
    • 2 篇 生物工程
    • 1 篇 力学(可授工学、理...
    • 1 篇 冶金工程
    • 1 篇 网络空间安全
  • 158 篇 理学
    • 146 篇 数学
    • 10 篇 生物学
    • 9 篇 统计学(可授理学、...
    • 4 篇 物理学
    • 2 篇 化学
  • 97 篇 管理学
    • 96 篇 管理科学与工程(可...
    • 9 篇 工商管理
  • 15 篇 经济学
    • 11 篇 应用经济学
    • 4 篇 理论经济学
  • 6 篇 法学
    • 4 篇 法学
    • 2 篇 社会学
  • 3 篇 军事学
  • 2 篇 教育学
    • 2 篇 心理学(可授教育学...
  • 2 篇 农学
  • 1 篇 医学
    • 1 篇 临床医学
    • 1 篇 特种医学

主题

  • 297 篇 exact algorithms
  • 20 篇 graph algorithms
  • 19 篇 heuristics
  • 18 篇 parameterized co...
  • 16 篇 combinatorial op...
  • 15 篇 approximation al...
  • 14 篇 parameterized al...
  • 14 篇 scheduling
  • 10 篇 vehicle routing
  • 9 篇 fixed-parameter ...
  • 9 篇 dynamic programm...
  • 8 篇 np-hardness
  • 8 篇 complexity
  • 7 篇 maximum satisfia...
  • 6 篇 traveling salesm...
  • 6 篇 metaheuristics
  • 6 篇 survey
  • 6 篇 dominating set
  • 6 篇 treewidth
  • 6 篇 steiner tree

机构

  • 8 篇 univ elect sci &...
  • 6 篇 univ bergen dept...
  • 6 篇 univ tubingen wi...
  • 5 篇 univ bologna dei...
  • 5 篇 lund univ dept c...
  • 5 篇 univ jena inst i...
  • 4 篇 univ utrecht ins...
  • 4 篇 maastricht univ ...
  • 4 篇 univ utrecht dep...
  • 4 篇 tu berlin inst s...
  • 3 篇 univ warsaw inst...
  • 3 篇 univ utrecht dep...
  • 3 篇 univ talca dept ...
  • 3 篇 univ bologna dei...
  • 3 篇 univ bergen dept...
  • 3 篇 nyu dept comp sc...
  • 3 篇 univ elect sci &...
  • 3 篇 univ warsaw wars...
  • 3 篇 lebanese amer un...
  • 3 篇 florida state un...

作者

  • 12 篇 bodlaender hans ...
  • 11 篇 niedermeier rolf
  • 10 篇 xiao mingyu
  • 8 篇 van rooij johan ...
  • 8 篇 niedermeier r
  • 7 篇 delorme maxence
  • 6 篇 nederlof jesper
  • 6 篇 vigo daniele
  • 6 篇 fomin fedor v.
  • 5 篇 guo j
  • 5 篇 kratsch dieter
  • 5 篇 monaci michele
  • 5 篇 liedloff mathieu
  • 5 篇 gramm j
  • 5 篇 bredereck robert
  • 4 篇 pilipczuk marcin
  • 4 篇 iori manuel
  • 4 篇 sorge manuel
  • 4 篇 chen jiehua
  • 4 篇 nagamochi hirosh...

语言

  • 274 篇 英文
  • 23 篇 其他
检索条件"主题词=Exact algorithms"
297 条 记 录,以下是221-230 订阅
排序:
exact algorithms for generalized combinatorial optimization problemsc
收藏 引用
1st International Conference on Combinatorial Optimization and Applications
作者: Pop, Petrica C. Sitar, Corina Pop Zelina, Ioana Tascu, Ioana North Univ Baia Fac Sci Dept Math & Comp Sci Baia Mare Romania North Univ Baia Mare Dept Econ Fac Studies Baia Mare Romania
We discuss fast exponential time exact algorithms for generalized combinatorial optimization problems. The list of discussed NP-complete generalized combinatorial optimization problems includes the generalized minimum... 详细信息
来源: 评论
An exact algorithm for connected red-blue dominating set
收藏 引用
JOURNAL OF DISCRETE algorithms 2011年 第3期9卷 252-262页
作者: Abu-Khzam, Faisal N. Mouawad, Amer E. Liedloff, Mathieu Lebanese Amer Univ Dept Comp Sci & Math Beirut Lebanon Univ Orleans Lab Informat Fdn Orleans F-45067 Orleans 2 France
In the Connected Red-Blue Dominating Set problem we are given a graph G whose vertex set is partitioned into two parts R and B (red and blue vertices), and we are asked to find a connected subgraph induced by a subset... 详细信息
来源: 评论
Recent advances in vehicle routing exact algorithms
收藏 引用
4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH 2007年 第4期5卷 269-298页
作者: Baldacci, Roberto Toth, Paolo Vigo, Daniele Univ Bologna DEIS I-47023 Cesena Italy Univ Bologna DEIS I-40136 Bologna Italy
The capacitated vehicle routing problem (CVRP) is the problem in which a set of identical vehicles located at a central depot is to be optimally routed to supply customers with known demands subject to vehicle capacit... 详细信息
来源: 评论
THE UNIFORM MINIMUM-ONES 2SAT PROBLEM AND ITS APPLICATION TO HAPLOTYPE CLASSIFICATION
收藏 引用
RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS 2010年 第3期44卷 363-377页
作者: Boeckenhauer, Hans-Joachim Forisek, Michal Oravec, Jan Steffen, Bjoern Steinhoefel, Kathleen Steinova, Monika ETH Dept Comp Sci Zurich Switzerland Comenius Univ Dept Comp Sci Bratislava 81806 Slovakia Kings Coll London Dept Comp Sci London England
Analyzing genomic data for finding those gene variations which are responsible for hereditary diseases is one of the great challenges in modern bioinformatics. In many living beings (including the human), every gene i... 详细信息
来源: 评论
A MORE RELAXED MODEL FOR GRAPH-BASED DATA CLUSTERING: s-PLEX CLUSTER EDITING
收藏 引用
SIAM JOURNAL ON DISCRETE MATHEMATICS 2010年 第4期24卷 1662-1683页
作者: Guo, Jiong Komusiewicz, Christian Niedermeier, Rolf Uhlmann, Johannes Univ Saarland D-66123 Saarbrucken Germany Univ Jena Inst Informat D-07743 Jena Germany
We introduce the s-Plex Cluster Editing problem as a generalization of the well-studied Cluster Editing problem;both are NP-hard and both are motivated by graph-based data clustering. Instead of transforming a given g... 详细信息
来源: 评论
Approximation and fixed-parameter algorithms for consecutive ones submatrix problems
收藏 引用
JOURNAL OF COMPUTER AND SYSTEM SCIENCES 2010年 第3-4期76卷 204-221页
作者: Dom, Michael Guo, Jiong Niedermeier, Rolf Univ Jena Inst Informat D-07743 Jena Germany
We develop an algorithmically useful refinement of a forbidden submatrix characterization of 0/1-matrices fulfilling the Consecutive Ones Property (C1P) This characterization finds applications in new polynomial-time ... 详细信息
来源: 评论
MINIMUM DOMINATING SET OF QUEENS: A trivial programming exercise?
收藏 引用
DISCRETE APPLIED MATHEMATICS 2010年 第4期158卷 308-318页
作者: Fernau, Henning Univ Trier FB Abt Informat 4 D-54286 Trier Germany
MINIMUM DOMINATING SET OF QUEENS is one of the typical programming exercises of a first year's computer science course. However, little work has been published on the complexity of this problem. We analyse here se... 详细信息
来源: 评论
A concise guide to the Traveling Salesman Problem
收藏 引用
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY 2010年 第1期61卷 35-40页
作者: Laporte, G. HEC Montreal Canada Res Chair Distribut Management Montreal PQ Canada
The Traveling Salesman Problem (TSP) is one of the most famous problems in combinatorial optimization. Hundreds of papers have been written on the TSP and several exact and heuristic algorithms are available for it. T... 详细信息
来源: 评论
A Bottom-Up Method and Fast algorithms for MAX INDEPENDENT SET
A Bottom-Up Method and Fast Algorithms for MAX INDEPENDENT S...
收藏 引用
12th Scandinavian Symposium and Workshops on Algorithm Theory
作者: Bourgeois, Nicolas Escoffier, Bruno Paschos, Vangelis Th. van Rooij, Johan M. M. CNRS LAMSADE FRE 3234 F-75700 Paris France Univ Utrecht Dept Informat & Comp Sci Utrecht Netherlands
We first propose a new method, called "bottom-up method", that, informally, "propagates" improvement of the worst-case complexity for "sparse" instances to "denser" ones and we ... 详细信息
来源: 评论
Determinant Sums for Undirected Hamiltonicity
Determinant Sums for Undirected Hamiltonicity
收藏 引用
IEEE 51st Annual Symposium on Foundations of Computer Science (FOCS)
作者: Bjorklund, Andreas Lund Univ Dept Comp Sci S-22100 Lund Sweden
We present a Monte Carlo algorithm for Hamiltonicity detection in an n-vertex undirected graph running in O*(1.657(n)) time. To the best of our knowledge, this is the first superpolynomial improvement on the worst cas... 详细信息
来源: 评论