咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是131-140 订阅
排序:
An exact algorithm for the Blocks Relocation Problem with new lower bounds
收藏 引用
COMPUTERS & OPERATIONS RESEARCH 2018年 99卷 206-217页
作者: Yucra Quispe, Kent E. Lintzmayer, Carla N. Xavier, Eduardo C. Univ Estadual Campinas Inst Comp Campinas SP Brazil Fed Univ ABC Ctr Math Computat & Cognit Santo Andre SP Brazil
The Blocks Relocation Problem is an important problem in storage systems. An input instance for it consists of a set of blocks distributed in stacks where each block is identified by a retrieval number and each stack ... 详细信息
来源: 评论
Collusion in Atomic Splittable Routing Games
收藏 引用
THEORY OF COMPUTING SYSTEMS 2013年 第4期52卷 763-801页
作者: Huang, Chien-Chung Humboldt Univ D-10099 Berlin Germany
We study how collusion affects the social cost in atomic splittable routing games. Suppose that players form coalitions and each coalition behaves as if it were a single player controlling all the flows of its partici... 详细信息
来源: 评论
A multivariate complexity analysis of the material consumption scheduling problem
收藏 引用
JOURNAL OF SCHEDULING 2023年 第4期26卷 369-382页
作者: Bentert, Matthias Bredereck, Robert Gyorgyi, Peter Kaczmarczyk, Andrzej Niedermeier, Rolf Tech Univ Berlin Fac Algorithm & Computat Complex 4 Berlin Germany Humboldt Univ Inst Informat Algorithm Engn Berlin Germany Tech Univ Clausthal Inst Informat Clausthal Zellerfeld Germany Eotvos Lorand Res Network Inst Comp Sci & Control Budapest Hungary AGH Univ Sci & Technol Krakow Poland
The NP-hard problem Material Consumption Scheduling and related problems have been thoroughly studied since the 1980's. Roughly speaking, the problem deals with scheduling jobs that consume non-renewable resources... 详细信息
来源: 评论
A note on a model for quay crane scheduling with non-crossing constraints
收藏 引用
ENGINEERING OPTIMIZATION 2015年 第6期47卷 860-865页
作者: Santini, Alberto Friberg, Henrik Alsing Ropke, Stefan Univ Bologna Dept Elect Elect & Informat Engn I-40126 Bologna Italy MOSEK Aps DK-2100 Copenhagen Denmark Tech Univ Denmark Dept Management Engn DK-2800 Lyngby Denmark
This article studies the quay crane scheduling problem with non-crossing constraints, which is an operational problem that arises in container terminals. An enhancement to a mixed integer programming model for the pro... 详细信息
来源: 评论
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 ... 详细信息
来源: 评论
An exact Algorithm for a Rich Vehicle Routing Problem with Private Fleet and Common Carrier
收藏 引用
TRANSPORTATION SCIENCE 2019年 第4期53卷 986-1000页
作者: Dabia, Said Lai, David Vigo, Daniele Vrije Univ Amsterdam Sch Business & Econ NL-1081 HV Amsterdam Netherlands Eyefreight BV NL-3981 AJ Bunnik Netherlands Univ Bologna Dept Elect Elect & Informat Engn I-40126 Bologna BO Italy
The vehicle routing problem with private fleet and common carrier (VRPPC) is a generalization of the classical vehicle routing problem in which the owner of a private fleet can either visit a customer with one of the ... 详细信息
来源: 评论
The capacitated team orienteering problem with incomplete service
收藏 引用
OPTIMIZATION LETTERS 2013年 第7期7卷 1405-1417页
作者: Archetti, Claudia Bianchessi, Nicola Speranza, M. Grazia Univ Brescia Dept Quantitat Methods Brescia Italy Univ Brescia Dept Informat Engn Brescia Italy
In this paper we study the capacitated version of the Team Orienteering Problem (TOP), that is the Capacitated TOP (CTOP) and the impact of relaxing the assumption that a customer, if served, must be completely served... 详细信息
来源: 评论
A Refined Branching Algorithm for the Maximum Satisfiability Problem
收藏 引用
ALGORITHMICA 2022年 第4期84卷 982-1006页
作者: Li, Wenjun Xu, Chao Yang, Yongjie Chen, Jianer Wang, Jianxin Changsha Univ Sci & Technol Hunan Prov Key Lab Intelligent Proc Big Data Tran Changsha Peoples R China Saarland Univ Fac Human & Business Sci Chair Econ Theory Saarbrucken Germany Texas A&M Univ Dept Comp Sci & Engn College Stn TX USA Cent South Univ Sch Comp Sci & Engn Changsha Peoples R China
The MAXIMUM SATISFIABILITY problem (MAXSAT) is a fundamental NP-hard problem which has significant applications in many areas. Based on refined observations, we derive a branching algorithm of running time O*(1.2989(m... 详细信息
来源: 评论
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... 详细信息
来源: 评论
An exact approach for Complete Test Set Generation of Toffoli-Fredkin-Peres based Reversible Circuits
收藏 引用
JOURNAL OF ELECTRONIC TESTING-THEORY AND APPLICATIONS 2016年 第2期32卷 175-196页
作者: Nagamani, A. N. Ashwin, S. Abhishek, B. Agrawal, V. K. PES Inst Technol Dept ECE PES Univ Campus Bangalore Karnataka India PES Inst Technol Dept Informat Sci & Engn PES Univ Campus Bangalore Karnataka India
Reversible logic has gained interest of researchers worldwide for its ultra-low power and high speed computing abilities in the future quantum information processing. Testing of these circuits is important for ensurin... 详细信息
来源: 评论