BRANCH-AND-BOUND METHODS - A SURVEY

被引：1004

作者：

LAWLER, EL

WOOD, DE

机构：

来源：

关键词：

D O I：

10.1287/opre.14.4.699

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：699 / +

页数：1

共 48 条

[31] LAWLER EL, 7 MIDW S CIRC THEOR
[32] LAWLER EL, TO APPEAR
[33] AN ALGORITHM FOR THE TRAVELING SALESMAN PROBLEM
LITTLE, JDC
MURTY, KG
SWEENEY, DW
KAREL, C
[J]. OPERATIONS RESEARCH, 1963, 11 (06) : 972 - 989
[34] A BRANCH-AND-BOUND ALGORITHM FOR THE EXACT SOLUTION OF THE 3-MACHINE SCHEDULING PROBLEM
LOMNICKI, ZA
[J]. OPERATIONAL RESEARCH QUARTERLY, 1965, 16 (01) : 89 - 100
[35] MINIMIZATION OF BOOLEAN FUNCTIONS
MCCLUSKEY, EJ
[J]. BELL SYSTEM TECHNICAL JOURNAL, 1956, 35 (06): : 1417 - 1444
[36] THE LOADING PROBLEM
PANDIT, SNN
[J]. OPERATIONS RESEARCH, 1962, 10 (05) : 639 - 646
[37] SOME OBSERVATIONS ON LONGEST PATH PROBLEM
PANDIT, SNN
[J]. OPERATIONS RESEARCH, 1964, 12 (02) : 361 - &
[38] PANDIT SNN, TO APPEAR
[39] RADO F, 1963, COMUNICARILE ACADEMI, V13, P1039
[40] ROSSMAN MJ, SOLUTION TRAVELINGSA