咨询与建议

限定检索结果

文献类型

  • 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 订阅
排序:
Sex-Equal Stable Matchings: Complexity and exact algorithms
收藏 引用
ALGORITHMICA 2014年 第3期68卷 545-570页
作者: McDermid, Eric Irving, Robert W. 21CT Austin TX 78730 USA Univ Glasgow Sch Comp Sci Glasgow G12 8QQ Lanark Scotland
We explore the complexity and exact computation of a variant of the classical stable marriage problem in which we seek matchings that are not only stable, but are also "fair" in a formal sense. In particular... 详细信息
来源: 评论
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... 详细信息
来源: 评论
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... 详细信息
来源: 评论
Research on Optimization of Postal Logistics Distribution Driven by Operations Research algorithms: A Case Study and Comparative Analysis  24
Research on Optimization of Postal Logistics Distribution Dr...
收藏 引用
6th International Conference on Management Science and Industrial Engineering, MSIE 2024
作者: Feng, Yicheng Gao, Benhe Li, Menghan Zhu, Guowei Shenzhen International Graduate School Tsinghua University China China Academy of Industrial Internet China
Based on the vehicle distribution optimization problem with time window in postal logistics, this paper intends to apply various operations research optimization algorithms such as exact algorithms, tabu search algori... 详细信息
来源: 评论
K-adaptability in stochastic optimization
收藏 引用
MATHEMATICAL PROGRAMMING 2022年 第1-2期196卷 567-595页
作者: Malaguti, Enrico Monaci, Michele Pruente, Jonas Univ Bologna DEI Guglielmo Marconi Viale Risorgimento 2 I-40136 Bologna Italy TU Dortmund Fak Math Vogelpothsweg 87 D-44227 Dortmund Germany
We consider stochastic problems in which both the objective function and the feasible set are affected by uncertainty. We address these problems using a K-adaptability approach, in which K solutions for a given proble... 详细信息
来源: 评论
Efficient algorithms for scheduling equal-length jobs with processing set restrictions on uniform parallel batch machines
收藏 引用
MATHEMATICAL BIOSCIENCES AND ENGINEERING 2022年 第11期19卷 10731-10740页
作者: Li, Shuguang Shandong Technol & Business Univ Sch Comp Sci & Technol Yantai 264005 Peoples R China
We consider the problem of scheduling jobs with equal lengths on uniform parallel batch machines with non-identical capacities where each job can only be processed on a specified subset of machines called its processi... 详细信息
来源: 评论
Efficient Production Scheduling by Exploiting Repetitive Product Configurations  21
Efficient Production Scheduling by Exploiting Repetitive Pro...
收藏 引用
IEEE 21st International Conference on Industrial Informatics (INDIN)
作者: Gruettemeier, Niels Balzereit, Kaja Soni, Nehal Bunte, Andreas Fraunhofer IOSB INA Lemgo Germany
We consider the problem of scheduling production jobs on a single machine with sequence dependent family setup times and individual job deadlines. Given a set of jobs, the goal is to minimize the total time to process... 详细信息
来源: 评论
Quantifying Instance Hardness of Protein Folding within the HP-model  20
Quantifying Instance Hardness of Protein Folding within the ...
收藏 引用
20th IEEE Conference on Computational Intelligence in Bioinformatics and Computational Biology (IEEE CIBCB)
作者: van Eck, Okke van den Berg, Daan Vrije Univ Amsterdam Netherlands
NP-hard problems are infamous for having highly varying and extreme runtimes for different problem instances. This study quantifies the instance hardness of NP-hard protein folding problem instances within the HP-mode... 详细信息
来源: 评论
Moderate exponential-time algorithms for scheduling problems
收藏 引用
4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH 2022年 第4期20卷 533-566页
作者: T'kindt, Vincent Della Croce, Federico Liedloff, Mathieu Univ Tours Lab Informat Fondamentale & Appl LIFAT EA 6300 ERL CNRS 7002ROOT 64 Ave Jean Portalis F-37200 Tours France Politecn Torino DIGEP Corso Duca Abruzzi 24 I-10129 Turin Italy Univ Orleans Lab Informat Fondamentale Orleans LIFO EA 4022 Rue Leonard de VinciBP 6759 F-45067 Orleans 2 France CNR IEIIT Turin Italy
This survey investigates the field of moderate exponential-time algorithms for NP-hard scheduling problems, i.e., exact algorithms whose worst-case time complexity is moderately exponential with respect to brute force... 详细信息
来源: 评论
Solving Euclidean Max-Sum problems exactly with cutting planes
收藏 引用
COMPUTERS & OPERATIONS RESEARCH 2024年 168卷
作者: Bui, Hoa T. Spiers, Sandy Loxton, Ryan Curtin Univ ARC Training Ctr Transforming Maintenance Data Sci Perth Australia Curtin Univ Curtin Ctr Optimisat & Decis Sci Perth Australia
This paper studies binary quadratic programs in which the objective is defined by the maximisation of a Euclidean distance matrix, subject to a general polyhedral constraint set. This class of nonconcave maximisation ... 详细信息
来源: 评论