DESIGN ISSUES IN RANDOMIZED BRANCH-AND-BOUND ALGORITHMS - A STUDY OF GRAPH PARTITIONING

被引：0

|

作者：

MISHRA, SK

RAGHAVAN, VV

机构：

来源：

INFORMATION PROCESSING '94, VOL I: TECHNOLOGY AND FOUNDATIONS | 1994年 / 51卷

关键词：

OPTIMIZATION; COMBINATORICS;

D O I：

暂无

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

收藏

页码：276 / 281

页数：6

相关论文

共 50 条

[1] Costs in design of scheduling algorithms: A study on branch-and-bound methodology
Amar, AD
[J]. COMPUTERS & INDUSTRIAL ENGINEERING, 1997, 32 (01) : 129 - 138
[2] Branch-and-bound algorithms on a hypercube
Pargas, R.P.
Wooster, D.E.
[J]. Conference on Hypercube Concurrent Computers and Applications, 1988,
[3] RANDOMIZED PARALLEL ALGORITHMS FOR BACKTRACK SEARCH AND BRANCH-AND-BOUND COMPUTATION
KARP, RM
ZHANG, YJ
[J]. JOURNAL OF THE ACM, 1993, 40 (03) : 765 - 789
[4] COMPUTATIONAL EFFICIENCY OF BRANCH-AND-BOUND ALGORITHMS
IBARAKI, T
[J]. JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 1977, 20 (01) : 16 - 35
[5] ANOMALIES IN PARALLEL BRANCH-AND-BOUND ALGORITHMS
LAI, TH
SAHNI, S
[J]. COMMUNICATIONS OF THE ACM, 1984, 27 (06) : 594 - 602
[6] EXPECTED PERFORMANCE OF BRANCH-AND-BOUND ALGORITHMS
LENSTRA, JK
RINNOOYKAN, AHG
[J]. OPERATIONS RESEARCH, 1978, 26 (02) : 347 - 349
[7] Learning to Search in Branch-and-Bound Algorithms
He, He
Daume, Hal, III
Eisner, Jason
[J]. ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 27 (NIPS 2014), 2014, 27
[8] PERFORMANCE OF PARALLEL BRANCH-AND-BOUND ALGORITHMS
LAI, TH
SPRAGUE, A
[J]. IEEE TRANSACTIONS ON COMPUTERS, 1985, 34 (10) : 962 - 964
[9] A branch-and-bound algorithm for the acyclic partitioning problem
Nossack, Jenny
Pesch, Erwin
[J]. COMPUTERS & OPERATIONS RESEARCH, 2014, 41 : 174 - 184
[10] Quantum speedup of branch-and-bound algorithms
Montanaro, Ashley
[J]. PHYSICAL REVIEW RESEARCH, 2020, 2 (01):

← 1 2 3 4 5 →