BRANCH-AND-BOUND METHODS - A SURVEY

被引：1029
作者：
LAWLER, EL
WOOD, DE
机构：
来源：
OPERATIONS RESEARCH | 1966年 / 14卷 / 04期
关键词：
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 [J].
LITTLE, JDC ;
MURTY, KG ;
SWEENEY, DW ;
KAREL, C .
OPERATIONS RESEARCH, 1963, 11 (06) :972-989
[34]   A BRANCH-AND-BOUND ALGORITHM FOR THE EXACT SOLUTION OF THE 3-MACHINE SCHEDULING PROBLEM [J].
LOMNICKI, ZA .
OPERATIONAL RESEARCH QUARTERLY, 1965, 16 (01) :89-100
[35]   MINIMIZATION OF BOOLEAN FUNCTIONS [J].
MCCLUSKEY, EJ .
BELL SYSTEM TECHNICAL JOURNAL, 1956, 35 (06) :1417-1444
[36]   THE LOADING PROBLEM [J].
PANDIT, SNN .
OPERATIONS RESEARCH, 1962, 10 (05) :639-646
[37]   SOME OBSERVATIONS ON LONGEST PATH PROBLEM [J].
PANDIT, SNN .
OPERATIONS RESEARCH, 1964, 12 (02) :361-&
[38]  
PANDIT SNN, TO APPEAR
[39]  
RADO F, 1963, COMUNICARILE ACADEMI, V13, P1039
[40]  
ROSSMAN MJ, SOLUTION TRAVELINGSA
12345