咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是21-30 订阅
排序:
exact algorithms for the Equitable Traveling Salesman Problem
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2017年 第2期261卷 475-485页
作者: Kinable, Joris Smeulders, Bart Delcour, Eline Spieksma, Frits C. R. Carnegie Mellon Univ Robot Inst 5000 Forbes Ave Pittsburgh PA 15213 USA Carnegie Mellon Univ Tepper Sch Business 5000 Forbes Ave Pittsburgh PA 15213 USA Katholieke Univ Leuven Dept Comp Sci CODeS Gebroeders De Smetstr 1 B-9000 Ghent Belgium Katholieke Univ Leuven IMinds ITEC Gebroeders De Smetstr 1 B-9000 Ghent Belgium Univ Liege HEC Management Sch QuantOM Rue Louvrex 14 B-4000 Liege Belgium Barry Callebaut Aalstersestr 122 B-9280 Lebbeke Belgium Katholieke Univ Leuven Fac Business & Econ ORSTAT Naamsestr 69 B-3000 Leuven Belgium
Given a weighted graph G = (V, E), the Equitable Traveling Salesman Problem (ETSP) asks for two perfect matchings in G such that (1) the two matchings together form a Hamiltonian cycle in G and (2) the absolute differ... 详细信息
来源: 评论
On exact algorithms for single-machine scheduling problems with a variable maintenance
收藏 引用
COMPUTERS & INDUSTRIAL ENGINEERING 2017年 107卷 276-279页
作者: Wang, Qi Liu, Aihua Xiao, Junfang East China Univ Technol Sch Sci Nanchang 330013 Jiangxi Peoples R China
The aim of this paper is to point out that all mathematical programming models proposed by Ying et al. (2016) are incorrect. We present four revised mathematical programming models and four improved mathematical progr... 详细信息
来源: 评论
exact algorithms for single-machine scheduling problems with a variable maintenance
收藏 引用
COMPUTERS & INDUSTRIAL ENGINEERING 2016年 第0期98卷 427-433页
作者: Ying, Kuo-Ching Lu, Chung-Cheng Chen, Jhao-Cheng Natl Taipei Univ Technol Dept Ind Engn & Management Taipei Taiwan Natl Chiao Tung Univ Dept Transportat & Logist Management Hsinchu Taiwan
This paper deals with four single-machine scheduling problems (SMSPs) with a variable machine maintenance. The objectives of the four SMSPs are to minimize mean lateness, maximum tardiness, total flow time and mean ta... 详细信息
来源: 评论
exact algorithms for Intervalizing Coloured Graphs
收藏 引用
THEORY OF COMPUTING SYSTEMS 2016年 第2期58卷 273-286页
作者: Bodlaender, Hans L. van Rooij, Johan M. M. Univ Utrecht Dept Informat & Comp Sci POB 80-089 NL-3508 TB Utrecht Netherlands Eindhoven Univ Technol Dept Math & Comp Sci POB 513 NL-5600 MB Eindhoven Netherlands Consultants Qualitat Methods POB 414 NL-5600 AK Eindhoven Netherlands
In the INTERVALIZING COLOURED GRAPHS problem, one must decide for a given graph G = (V, E) with a proper vertex colouring of G whether G is the subgraph of a properly coloured interval graph. For the case that the num... 详细信息
来源: 评论
Bin packing and cutting stock problems: Mathematical models and exact algorithms
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2016年 第1期255卷 1-20页
作者: Delorme, Maxence Iori, Manuel Martello, Silvano Alma Mater Studiorum Univ Bologna DEI Guglielmo Marconi Viale Risorgimento 2 I-40136 Bologna Italy Univ Modena & Reggio Emilia DISMI Via Giovanni Amendola 2 I-42122 Reggio Emilia Italy
We review the most important mathematical models and algorithms developed for the exact solution of the one-dimensional bin packing and cutting stock problems, and experimentally evaluate, on state-of-the art computer... 详细信息
来源: 评论
exact algorithms for Kayles
收藏 引用
THEORETICAL COMPUTER SCIENCE 2015年 第C期562卷 165-176页
作者: Bodlaender, Hans L. Kratsch, Dieter Timmer, Sjoerd T. Univ Utrecht NL-3508 TB Utrecht Netherlands Univ Lorraine Metz LITA F-57045 Metz 01 France
In the game of KAYLES, two players select alternatingly a vertex from a given graph G, but may never choose a vertex that is adjacent or equal to an already chosen vertex. The last player that can select a vertex wins... 详细信息
来源: 评论
exact algorithms for dominating induced matching based on graph partition
收藏 引用
DISCRETE APPLIED MATHEMATICS 2015年 190卷 147-162页
作者: Xiao, Mingyu Nagamochi, Hiroshi Univ Elect Sci & Technol China Sch Comp Sci & Engn Chengdu 611731 Peoples R China Kyoto Univ Grad Sch Informat Dept Appl Math & Phys Sakyo Ku Kyoto 6068501 Japan
A dominating induced matching, also called an efficient edge domination, of a graph G = (V, E) with n = vertical bar V vertical bar vertices and m = vertical bar E vertical bar edges is a subset F subset of E of edges... 详细信息
来源: 评论
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 ... 详细信息
来源: 评论
On the exact quantum query complexity of MOD and exact functions
收藏 引用
Frontiers of Computer Science 2025年 第4期19卷 91-98页
作者: Penghui YAO Zekun YE State Key Laboratory for Novel Software Technology Nanjing UniversityNanjing 210023China Hefei National Laboratory Hefei 230088China
In this paper,we consider the exact quantum query complexity of two fundamental symmetric functions.1)MOD_(m)^(n),which calculates the Hamming weight of an-bit string modulo;2)exact_(k,l)^(n),which determines if the H... 详细信息
来源: 评论
A model-based algorithm for the Probabilistic Orienteering Problem
收藏 引用
COMPUTERS & OPERATIONS RESEARCH 2025年 176卷
作者: Montemanni, Roberto Smith, Derek H. Univ Modena & Reggio Emilia Dept Sci & Methods Engn Via Amendola 2 I-42122 Reggio Emilia Italy Univ South Wales Comp & Math Pontypridd CF37 1DL Wales
The Orienteering Problem is a routing problem aiming at selecting a subset of a given set of customers to visited within a given time budget, so that a total revenue is maximized. Multiple variants of the problem have... 详细信息
来源: 评论