咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是151-160 订阅
排序:
Fifty Years of Vehicle Routing
收藏 引用
TRANSPORTATION SCIENCE 2009年 第4期43卷 408-416页
作者: Laporte, Gilbert HEC Montreal CIRRELT Montreal PQ H3T 2A7 Canada
The Vehicle Routing Problem (VRP) was introduced 50 years ago by Dantzig and Ramser under the title "The Truck Dispatching Problem." The study of the VRP has given rise to major developments in the fields of... 详细信息
来源: 评论
Partition Into Triangles on Bounded Degree Graphs
收藏 引用
THEORY OF COMPUTING SYSTEMS 2013年 第4期52卷 687-718页
作者: van Rooij, Johan M. M. Niekerk, Marcel E. van Kooten Bodlaender, Hans L. Univ Utrecht Dept Informat & Comp Sci NL-3508 TB Utrecht Netherlands
We consider the Partition Into Triangles problem on bounded degree graphs. We show that this problem is polynomial-time solvable on graphs of maximum degree three by giving a linear-time algorithm. We also show that t... 详细信息
来源: 评论
K-adaptability in stochastic optimization
收藏 引用
MATHEMATICAL PROGRAMMING 2022年 第1-2期196卷 567-595页
作者: Malaguti, Enrico Monaci, Michele Pruente, Jonas Univ Bologna DEI Guglielmo Marconi Viale Risorgimento 2 I-40136 Bologna Italy TU Dortmund Fak Math Vogelpothsweg 87 D-44227 Dortmund Germany
We consider stochastic problems in which both the objective function and the feasible set are affected by uncertainty. We address these problems using a K-adaptability approach, in which K solutions for a given proble... 详细信息
来源: 评论
Automated generation of search tree algorithms for hard graph modification problems
收藏 引用
ALGORITHMICA 2004年 第4期39卷 321-347页
作者: Gramm, J Guo, J Hüffner, F Niedermeier, R Univ Tubingen Wilhelm Schickard Inst Informat D-72076 Tubingen Germany
We present a framework for an automated generation of exact search tree algorithms for NP-hard problems. The purpose of our approach is twofold-rapid development and improved upper bounds. Many search tree algorithms ... 详细信息
来源: 评论
Algorithm 864: General and robot-packable variants of the three-dimensional bin packing problem
收藏 引用
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE 2007年 第1期33卷 7.1-7.12页
作者: Martello, Silvano Pisinger, David Vigo, Daniele Den Boef, Edgar Korst, Jan Univ Copenhagen DIKU DK-2100 Copenhagen Denmark Philips Res Labs Eindhoven NL-5656 AA Eindhoven Netherlands
We consider the problem of orthogonally packing a given set of rectangular-shaped boxes into the minimum number of three-dimensional rectangular bins. The problem is NP-hard in the strong sense and extremely difficult... 详细信息
来源: 评论
Solving the 2-Disjoint Connected Subgraphs Problem Faster than 2 n
收藏 引用
ALGORITHMICA 2014年 第2期70卷 195-207页
作者: Cygan, Marek Pilipczuk, Marcin Pilipczuk, Micha Wojtaszczyk, Jakub Onufry Univ Warsaw Inst Informat Warsaw Poland Univ Bergen Dept Informat N-5008 Bergen Norway Google Inc Warsaw Poland
The 2-Disjoint Connected Subgraphs problem, given a graph along with two disjoint sets of terminals Z (1),Z (2), asks whether it is possible to find disjoint sets A (1),A (2), such that Z (1)aS dagger A (1), Z (2)aS d... 详细信息
来源: 评论
Going weighted: Parameterized algorithms for cluster editing
收藏 引用
THEORETICAL COMPUTER SCIENCE 2009年 第52期410卷 5467-5480页
作者: Boecker, S. Briesemeister, S. Bui, Q. B. A. Truss, A. Univ Jena Lehrstuhl Bioinformat D-07743 Jena Germany Univ Tubingen Div Simulat Biol Syst ZBIT WSI D-72074 Tubingen Germany
The goal Of the CLUSTER EDITING problem is to make the fewest changes to the edge set of an input graph such that the resulting graph is a disjoint union Of cliques. This problem is NP-complete but recently, several p... 详细信息
来源: 评论
A review on algorithms for maximum clique problems
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2015年 第3期242卷 693-709页
作者: Wu, Qinghua Hao, Jin-Kao Huazhong Univ Sci & Technol Sch Management Wuhan 430074 Peoples R China Univ Angers LERIA F-49045 Angers 1 France
The maximum clique problem (MCP) is to determine in a graph a clique (i.e., a complete subgraph) of maximum cardinality. The MCP is notable for its capability of modeling other combinatorial problems and real-world ap... 详细信息
来源: 评论
Modelling and solving the perfect edge domination problem
收藏 引用
OPTIMIZATION LETTERS 2020年 第2期14卷 369-394页
作者: Forte, Vinicius L. Lin, Min Chih Lucena, Abilio Maculan, Nelson Moyano, Veronica A. Szwarcfiter, Jayme L. Univ Fed Rural Rio de Janeiro Dept Matemat Seropedica Brazil Univ Buenos Aires Inst Calculo Buenos Aires DF Argentina Univ Buenos Aires Dept Computac Buenos Aires DF Argentina Univ Fed Rio de Janeiro Programa Engn Sistemas & Comp Rio De Janeiro Brazil Univ Estado Rio de Janeiro Inst Matemat & Estat Rio De Janeiro Brazil
A formulation is proposed for the perfect edge domination problem and some exact algorithms based on it are designed and tested. So far, perfect edge domination has been investigated mostly in computational complexity... 详细信息
来源: 评论
algorithms for (n,3)-MAXSAT and parameterization above the all-true assignment
收藏 引用
THEORETICAL COMPUTER SCIENCE 2020年 803卷 222-233页
作者: Belova, Tatiana Bliznets, Ivan Russian Acad Sci Steklov Inst Math St Petersburg Dept Moscow Russia Natl Res Univ Higher Sch Econ Moscow Russia
In this paper, we consider the (n,3)-MAXSAT problem. The problem is a special case of the Maximum Satisfiability problem with an additional requirement that in the input formula each variable appears at most three tim... 详细信息
来源: 评论