咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是41-50 订阅
排序:
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... 详细信息
来源: 评论
Improved exact algorithms for MAX-SAT  5
收藏 引用
5th Latin American Symposium on Theoretical Informatics (LATIN 2002)
作者: Chen, JE Kanj, IA Depaul Univ Sch CTI Chicago IL 60604 USA Texas A&M Univ Dept Comp Sci College Stn TX 77843 USA
In this paper, we present improved exact and parameterized algorithms for the maximum satisfiability problem. In particular, we give an algorithm that computes a truth assignment for a boolean formula F satisfying the... 详细信息
来源: 评论
exact algorithms for a joint order acceptance and scheduling problem
收藏 引用
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS 2020年 223卷 107516-107516页
作者: Li, Xin Ventura, Jose A. Penn State Univ Harold & Inge Marcus Dept Ind & Mfg Engn University Pk PA 16802 USA
This paper considers the scenario where a manufacturer receives multiple orders that are characterized by the revenue, processing time, due date, and tardiness penalty per time unit. The manufacturer can be seen as a ... 详细信息
来源: 评论
exact algorithms for solving the constrained parallel-machine scheduling problems with divisible processing times and penalties
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2023年 第4期45卷 98-98页
作者: Li, Jianping Xie, Runtao Lichen, Junran Hu, Guojun Pan, Pengxiang Yang, Ping Yunnan Univ Univ Town Sch Math & Stat East Outer Ring South Rd Kunming 650504 Peoples R China Beijing Univ Chem Technol Sch Math & Phys 15 North Third Ring East Rd Beijing 100029 Peoples R China
In this paper, we address the constrained parallel-machine scheduling problem with divisible processing times and penalties (the CPS-DTP problem), which is a further generalization of the parallel-machine scheduling p... 详细信息
来源: 评论
Uniqueness, intractability and exact algorithms: Reflections on level-κ phylogenetic networks
收藏 引用
Journal of Bioinformatics and Computational Biology 2009年 第4期7卷 597-623页
作者: Van Iersel, Leo Kelk, Steven Mnich, Matthias Department of Mathematics and Computer Science Technische Universiteit Eindhoven 5600 MB Eindhoven P. O. Box 513 Netherlands Centrum voor Wiskunde en Informatica (CWI) 1090 GB Amsterdam P. O. Box 94079 Netherlands
Phylogenetic networks provide a way to describe and visualize evolutionary histories that have undergone so-called reticulate evolutionary events such as recombination, hybridization or horizontal gene transfer. The l... 详细信息
来源: 评论
exact algorithms for Maximum Lifetime Data-Gathering Tree in Wireless Sensor Networks
收藏 引用
INFORMS JOURNAL ON COMPUTING 2022年 第4期34卷 1987-2002页
作者: Casazza, Marco Ceselli, Alberto Univ Milan Dipartimento Informat I-20133 Milan Italy
We tackle an optimization problem arising in the design of sensor networks: given a set of sensors, only one being connected to a backbone, to establish connection routes from each of them to the sink. Under a shortes... 详细信息
来源: 评论
Resolution-exact algorithms for Link Robots  11th
Resolution-Exact Algorithms for Link Robots
收藏 引用
11th Workshop on Algorithmic Foundations of Robotics (WAFR)
作者: Luo, Zhongdi Chiang, Yi-Jen Lien, Jyh-Ming Yap, Chee NYU Dept Comp Sci New York NY USA NYU Dept Comp Sci & Engn Brooklyn NY USA George Mason Univ Dept Comp Sci Fairfax VA 22030 USA
Motion planning is a major topic in robotics. Divergent paths have been taken by practical roboticists and theoretical motion planners. Our goal is to produce algorithms that are practical and have strong theoretical ... 详细信息
来源: 评论
exact algorithms for the 0-1 Time-Bomb Knapsack Problem
收藏 引用
COMPUTERS & OPERATIONS RESEARCH 2022年 145卷 1页
作者: Monaci, Michele Pike-Burke, Ciara Santini, Alberto Univ Bologna Dept Elect Elect & Informat Engn Bologna Italy Imperial Coll London Dept Math London England Univ Pompeu Fabra Dept Econ & Business Barcelona Spain
We consider a stochastic version of the 0-1 Knapsack Problem in which, in addition to profit and weight, each item is associated with a probability of exploding and destroying all the contents of the knapsack. The obj... 详细信息
来源: 评论
Branch & Memorize exact algorithms for sequencing problems: Efficient embedding of memorization into search trees
收藏 引用
COMPUTERS & OPERATIONS RESEARCH 2021年 128卷 105171-105171页
作者: Shang, Lei T'Kindt, Vincent Della Croce, Federico Univ Tours LIFAT EA 6300 ERL CNRS ROOT 7002 Tours France Politecn Torino DIGEP Turin Italy CNR IEIIT Turin Italy
Memorization, as an algorithm design technique, enables to speed up algorithms at the price of increased space usage. In this work, we focus on search tree algorithms applied to sequencing problems. In these algorithm... 详细信息
来源: 评论
On exact algorithms for Treewidth
收藏 引用
ACM TRANSACTIONS ON algorithms 2012年 第1期9卷 12-12页
作者: Bodlaender, Hans L. Fomin, Fedor V. Koster, Arie M. C. A. Kratsch, Dieter Thilikos, Dimitrios M. Univ Utrecht Dept Informat & Comp Sci NL-3508 TB Utrecht Netherlands Univ Bergen Dept Informat N-5020 Bergen Norway Univ Aachen Aachen Germany Univ Metz LITA F-507045 Metz 01 France Univ Athens GR-10679 Athens Greece
We give experimental and theoretical results on the problem of computing the treewidth of a graph by exact exponential-time algorithms using exponential space or using only polynomial space. We first report on an impl... 详细信息
来源: 评论