咨询与建议

限定检索结果

文献类型

  • 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 订阅
排序:
Roundoff-Error-Free algorithms for Solving Linear Systems via Cholesky and LU Factorizations
收藏 引用
INFORMS JOURNAL ON COMPUTING 2015年 第4期27卷 677-689页
作者: Escobedo, Adolfo R. Moreno-Centeno, Erick Texas A&M Univ Dept Ind & Syst Engn College Stn TX 77843 USA
LU and Cholesky factorizations are computational tools for efficiently solving linear systems that play a central role in solving linear programs and several other classes of mathematical programs. In many documented ... 详细信息
来源: 评论
On the empirical time complexity of finding optimal solutions vs proving optimality for Euclidean TSP instances
收藏 引用
OPTIMIZATION LETTERS 2015年 第6期9卷 1247-1254页
作者: Hoos, Holger H. Stutzle, Thomas Univ British Columbia Dept Comp Sci Vancouver BC V6T 1W5 Canada Univ Libre Bruxelles IRIDIA CoDE Brussels Belgium
We investigate the empirical performance of the long-standing state-of-the-art exact TSP solver Concorde on various classes of Euclidean TSP instances and show that, surprisingly, the time spent until the first optima... 详细信息
来源: 评论
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... 详细信息
来源: 评论
DETECTING AND COUNTING SMALL PATTERN GRAPHS
收藏 引用
SIAM JOURNAL ON DISCRETE MATHEMATICS 2015年 第3期29卷 1322-1339页
作者: Floderus, Peter Kowaluk, Miroslaw Lingas, Andrzej Lundell, Eva-Marta Lund Univ Ctr Math Sci S-22100 Lund Sweden Warsaw Univ Inst Informat Warsaw Poland Lund Univ Dept Comp Sci S-22100 Lund Sweden
We study the induced subgraph isomorphism problem and the general subgraph isomorphism problem for small pattern graphs. We present a new general method for detecting induced subgraphs of a host graph isomorphic to a ... 详细信息
来源: 评论
exact algorithm for matrix-based project planning problems
收藏 引用
EXPERT SYSTEMS WITH APPLICATIONS 2015年 第9期42卷 4460-4473页
作者: Kosztyan, Zsolt T. Univ Pannonia Dept Quantitat Methods Veszprem Hungary
This paper proposes a new matrix-based project planning method that takes into consideration task importance or probability of completions thus determines and ranks the importance or probability of possible project sc... 详细信息
来源: 评论
A literature review on the vehicle routing problem with multiple depots
收藏 引用
COMPUTERS & INDUSTRIAL ENGINEERING 2015年 79卷 115-129页
作者: Montoya-Torres, Jairo R. Lopez Franco, Julian Nieto Isaza, Santiago Felizzola Jimenez, Heriberto Herazo-Padilla, Nilson Univ La Sabana Escuela Int Ciencias Econ & Adm Chia Cundinamarca Colombia Engn & Consulting SAS Bogota DC Colombia Univ Norte Dept Ingn Ind Barranquilla Atlantico Colombia Univ La Sabana Dept Ingn Ind Bogota DC Colombia Univ Costa Dept Ingn Ind Barranquilla Colombia Fdn Ctr Invest Modelac Empresarial Caribe Barranquilla Colombia
In this paper, we present a state-of-the-art survey on the vehicle routing problem with multiple depots (MDVRP). Our review considered papers published between 1988 and 2014, in which several variants of the model are... 详细信息
来源: 评论
An overview of curriculum-based course timetabling
收藏 引用
TOP 2015年 第2期23卷 313-349页
作者: Bettinelli, Andrea Cacchiani, Valentina Roberti, Roberto Toth, Paolo Univ Bologna DEI I-40136 Bologna Italy Tech Univ Denmark Dept Transport DK-2800 Lyngby Denmark
In 2007, the Second International Timetabling Competition (ITC-2007) has been organized and a formal definition of the Curriculum-Based Course Timetabling (CB-CTT) problem has been given, by taking into account severa... 详细信息
来源: 评论
Affinity Propagation and Uncapacitated Facility Location Problems
收藏 引用
JOURNAL OF CLASSIFICATION 2015年 第3期32卷 443-480页
作者: Brusco, Michael J. Steinley, Douglas Florida State Univ Coll Business Tallahassee FL 32306 USA Univ Missouri Dept Psychol Sci Columbia MO 65203 USA
One of the most important distinctions that must be made in clustering research is the difference between models (or problems) and the methods for solving those problems. Nowhere is this more evident than with the eva... 详细信息
来源: 评论
An exact Algorithm for the Two-Mode KL-Means Partitioning Problem
收藏 引用
JOURNAL OF CLASSIFICATION 2015年 第3期32卷 481-515页
作者: Brusco, Michael J. Doreian, Patrick Florida State Univ Coll Business Tallahassee FL 32306 USA Univ Ljubljana Fac Social Sci Ljubljana Slovenia Univ Pittsburgh Dept Sociol Pittsburgh PA USA
Two-mode partitioning applications are increasingly common in the physical and social sciences with a variety of models and methods spanning these applications. Two-mode KL-means partitioning (TMKLMP) is one type of t... 详细信息
来源: 评论
Parallelizing exact motif finding algorithms on multi-core
收藏 引用
JOURNAL OF SUPERCOMPUTING 2014年 第2期69卷 814-826页
作者: Abbas, Mostafa M. Bahig, Hazem M. Abouelhoda, Mohamed Mohie-Eldin, M. M. Qatar Univ Coll Engn KINDI Lab Comp Res Doha Qatar Sinai Univ Dept Basic Sci Fac Engn Al Arish Egypt Hail Univ Coll Comp Sci & Engn Comp Sci & Software Engn Dept Hail Saudi Arabia Ain Shams Univ Div Comp Sci Dept Math Fac Sci Cairo 11566 Egypt Cairo Univ Syst & Biomed Engn Dept Fac Engn Giza Egypt Nile Univ Ctr Informat Sci Giza Egypt Al Azhar Univ Fac Sci Dept Math Cairo Egypt
The motif finding problem is one of the important and challenging problems in bioinformatics. A variety of sequential algorithms have been proposed to find exact motifs, but the running time is still not suitable due ... 详细信息
来源: 评论