咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是121-130 订阅
排序:
Assembly line balancing under uncertainty: Robust optimization models and exact solution method
收藏 引用
COMPUTERS & INDUSTRIAL ENGINEERING 2013年 第2期65卷 261-267页
作者: Hazir, Oncu Dolgui, Alexandre TED Univ Iktisadi & Idari Bilimler Fak TR-06420 Ankara Turkey Ecole Natl Super Mines EMSE FAYOL CNRS UMR6158 LIMOS F-42023 St Etienne France
This research deals with line balancing under uncertainty and presents two robust optimization models. Interval uncertainty for operation times was assumed. The methods proposed generate line designs that are protecte... 详细信息
来源: 评论
Scheduling twin robots on a line
收藏 引用
NAVAL RESEARCH LOGISTICS 2014年 第2期61卷 119-130页
作者: Erdogan, Guenes Battarra, Maria Laporte, Gilbert Univ Southampton Sch Management Southampton SO17 1BJ Hants England Univ Southampton Sch Math Southampton SO17 1BJ Hants England HEC Montreal Canada Res Chair Distribut Management Montreal PQ H3T 2A7 Canada
This article introduces the twin robots scheduling problem (TRSP), in which two robots positioned at the opposite ends of a rail are required to deliver items to positions along the rail, and the objective is to minim... 详细信息
来源: 评论
Approximation algorithms for solving the line-capacitated minimum Steiner tree problem
收藏 引用
JOURNAL OF GLOBAL OPTIMIZATION 2022年 第3期84卷 687-714页
作者: Li, Jianping Wang, Wencheng Lichen, Junran Liu, Suding Pan, Pengxiang Yunnan Univ Dept Math East Outer Ring South Rd Kunming 650504 Yunnan Peoples R China Chinese Acad Sci Acad Math & Syst Sci Inst Appl Math 55 Zhongguancun East Rd Beijing 100190 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 line-capacitated minimum Steiner tree problem (the Lc-MStT problem, for short), which is a variant of the (Euclidean) capacitated minimum Steiner tree problem and defined as follows. Give... 详细信息
来源: 评论
BOUNDING THE RUNNING TIME OF algorithms FOR SCHEDULING AND PACKING PROBLEMS
收藏 引用
SIAM JOURNAL ON DISCRETE MATHEMATICS 2016年 第1期30卷 343-366页
作者: Jansen, K. Land, F. Land, K. Univ Kiel Inst Informat Olshausenstr 40 D-24098 Kiel Germany
Our goal is to show tight bounds on the running time of algorithms for scheduling and packing problems. To prove lower bounds, we investigate implications of the exponential time hypothesis on such algorithms. For exa... 详细信息
来源: 评论
Some Reduction Procedure for Computing Pathwidth of Undirected Graphs
收藏 引用
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2015年 第3期E98D卷 503-511页
作者: Ikeda, Masataka Nagamochi, Hiroshi Kyoto Univ Grad Sch Informat Dept Appl Math & Phys Kyoto 6068501 Japan
Computing an invariant of a graph such as treewidth and pathwidth is one of the fundamental problems in graph algorithms. In general, determining the pathwidth of a graph is NP-hard. In this paper, we propose several ... 详细信息
来源: 评论
algorithms for learning parsimonious context trees
收藏 引用
MACHINE LEARNING 2019年 第6期108卷 879-911页
作者: Eggeling, Ralf Grosse, Ivo Koivisto, Mikko Univ Helsinki Dept Comp Sci Helsinki Finland Univ Tubingen Dept Comp Sci Tubingen Germany Martin Luther Univ Halle Wittenberg Inst Comp Sci Halle Germany
Parsimonious context trees, PCTs, provide a sparse parameterization of conditional probability distributions. They are particularly powerful for modeling context-specific independencies in sequential discrete data. Le... 详细信息
来源: 评论
Order picking problems under weight, fragility and category constraints
收藏 引用
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2017年 第21期55卷 6361-6379页
作者: Chabot, Thomas Lahyani, Rahma Coelho, Leandro C. Renaud, Jacques Univ Laval CIRRELT Fac Sci Adm Quebec City PQ Canada Al Faisal Univ Coll Business Riyadh Saudi Arabia Inst Super Gest Ind LOGIQ Lab Sfax Tunisia Univ Laval Canada Res Chair Integrated Logist Quebec City PQ Canada
Warehouse order picking activities are among the ones that impact the most the bottom lines of warehouses. They are known to often account for more than half of the total warehousing costs. New practices and innovatio... 详细信息
来源: 评论
The Complexity of Finding Effectors
收藏 引用
THEORY OF COMPUTING SYSTEMS 2017年 第2期60卷 253-279页
作者: Bulteau, Laurent Fafianie, Stefan Froese, Vincent Niedermeier, Rolf Talmon, Nimrod Univ Paris Est Marne La Vallee CNRS UMR 8049 IGM LabInfo Marne La Vallee France Univ Bonn Inst Informat Bonn Germany Weizmann Inst Sci Rehovot Israel TU Berlin Inst Softwaretech & Theoret Informat Berlin Germany
The NP-hard Effectors problem on directed graphs is motivated by applications in network mining, particularly concerning the analysis of probabilistic information-propagation processes in social networks. In the corre... 详细信息
来源: 评论
Shortest color-spanning intervals
收藏 引用
THEORETICAL COMPUTER SCIENCE 2016年 第Part3期609卷 561-568页
作者: Jiang, Minghui Wang, Haitao Utah State Univ Dept Comp Sci Logan UT 84322 USA
Given a set of n points on a line, where each point has one of k colors, and given an integer si >= 1 for each color i, 1 = 1. We also obtain some interesting results for the general problem SCSI-t. From the negati... 详细信息
来源: 评论
The production routing problem: A review of formulations and solution algorithms
收藏 引用
COMPUTERS & OPERATIONS RESEARCH 2015年 55卷 141-152页
作者: Adulyasak, Yossiri Cordeau, Jean-Francois Jans, Raf HEC Montreal Montreal PQ H3T 2A7 Canada CIRRELT Montreal PQ H3T 2A7 Canada
The production routing problem (PRP) combines the lot-sizing problem and the vehicle routing problem, two classical problems that have been extensively studied for more than half a century. The PRP is solved in an att... 详细信息
来源: 评论