咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是101-110 订阅
排序:
Towards effective exact methods for the Maximum Balanced Biclique Problem in bipartite graphs
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2018年 第3期269卷 834-843页
作者: Zhou, Yi Rossi, Andre Hao, Jin-Kao Univ Elect Sci & Technol China Sch Comp Sci & Engn Chengdu 617731 Sichuan Peoples R China Univ Angers LERIA 2 Bd Lavoisier F-49045 Angers France Inst Univ France 1 Rue Descartes F-75231 Paris France
The Maximum Balanced Biclique Problem (MBBP) is a prominent model with numerous applications. Yet. the problem is NP-hard and thus computationally challenging. We propose novel ideas for designing effective exact algo... 详细信息
来源: 评论
Improved algorithms to minimize workload balancing criteria on identical parallel machines
收藏 引用
COMPUTERS & OPERATIONS RESEARCH 2018年 93卷 123-134页
作者: Schwerdfeger, Stefan Walter, Rico Friedrich Schiller Univ Jena Chair Management Sci Carl Zeiss Str 3 D-07793 Jena Germany
In Schwerdfeger and Walter (2016), we proposed a subset sum based improvement procedure (denoted by LS) for solving the problem of minimizing the normalized sum of squared workload deviations on m identical machines. ... 详细信息
来源: 评论
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 ... 详细信息
来源: 评论
exact algorithms for Edge Domination
收藏 引用
ALGORITHMICA 2012年 第4期64卷 535-563页
作者: van Rooij, Johan M. M. Bodlaender, Hans L. Univ Utrecht Inst Informat & Comp Sci NL-3508 TB Utrecht Netherlands
An edge dominating set in a graph G=(V,E) is a subset of the edges DaS dagger E such that every edge in E is adjacent or equal to some edge in D. The problem of finding an edge dominating set of minimum cardinality is... 详细信息
来源: 评论
Minimum tiling of a rectangle by squares
收藏 引用
ANNALS OF OPERATIONS RESEARCH 2018年 第2期271卷 831-851页
作者: Monaci, Michele dos Santos, Andre Gustavo Univ Bologna DEI Viale Risorgimento 2 I-40136 Bologna Italy Univ Fed Vicosa DPI Ave PH Rolfs S-N BR-36570900 Vicosa MG Brazil
We consider a two-dimensional problem in which one is required to split a given rectangular bin into the smallest number of items. The resulting items must be squares to be packed, without overlapping, into the bin so... 详细信息
来源: 评论
Synergistic team composition: A computational approach to foster diversity in teams
收藏 引用
KNOWLEDGE-BASED SYSTEMS 2019年 182卷 104799-000页
作者: Andrejczuk, Ewa Bistaffa, Filippo Blum, Christian Rodriguez-Aguilar, Juan A. Sierra, Carles IIIA CSIC Artificial Intelligence Res Inst Campus UAB Bellaterra Catalonia Spain Nanyang Technol Univ ST Engn NTU Corp Lab Singapore Singapore
Co-operative learning in heterogeneous teams refers to learning methods in which teams are organised both to accomplish academic tasks and for individuals to gain knowledge. Competencies, personality and the gender of... 详细信息
来源: 评论
Solving rank-constrained semidefinite programs in exact arithmetic
收藏 引用
JOURNAL OF SYMBOLIC COMPUTATION 2018年 第Mar./Apr.期85卷 206-223页
作者: Naldi, Simone Tech Univ Dortmund Fak Math Vogelpothsweg 87 D-44227 Dortmund Germany
We consider the problem of minimizing a linear function over an affine section of the cone of positive semidefinite matrices, with the additional constraint that the feasible matrix has prescribed rank. When the rank ... 详细信息
来源: 评论
exact algorithms for Maximum Clique: A Computational Study
收藏 引用
algorithms 2012年 第4期5卷 545-587页
作者: Prosser, Patrick Univ Glasgow Comp Sci Glasgow G12 8QQ Lanark Scotland
We investigate a number of recently reported exact algorithms for the maximum clique problem. The program code is presented and analyzed to show how small changes in implementation can have a drastic effect on perform... 详细信息
来源: 评论
Some Results on Shop Scheduling with S-Precedence Constraints among Job Tasks
收藏 引用
algorithms 2019年 第12期12卷 250页
作者: Agnetis, Alessandro Rossi, Fabrizio Smriglio, Stefano Univ Siena Dipartimento Ingn Informaz & Sci Matemat I-53100 Siena SI Italy Univ Aquila Dipartimento Ingn & Sci Informaz & Matemat I-67100 Laquila AQ Italy
We address some special cases of job shop and flow shop scheduling problems with s-precedence constraints. Unlike the classical setting, in which precedence constraints among the tasks of a job are finish-start, here ... 详细信息
来源: 评论
Upper and Lower Bounds for Different Parameterizations of (n,3)-MAXSAT  12th
Upper and Lower Bounds for Different Parameterizations of (n...
收藏 引用
12th Annual International Conference on Combinatorial Optimization and Applications (COCOA)
作者: Belova, Tatiana Bliznets, Ivan Russian Acad Sci St Petersburg Dept Steklov Inst Math St Petersburg Russia
In this paper, we consider the (n,3)-MAXSAT problem. The problem is a special case of the Maximum Satisfiability problem with an additional requirement that in input formula each variable appears at most three times. ... 详细信息
来源: 评论