A BRANCH AND BOUND ALGORITHM FOR THE CAPACITATED VEHICLE-ROUTING PROBLEM

被引：99

作者：

LAPORTE, G ^{[1
]}

NOBERT, Y ^{[1
]}

机构：

[1] UNIV QUEBEC, DEPT SCI ADM, MONTREAL H3C 3P8, QUEBEC, CANADA

来源：

关键词：

D O I：

10.1007/BF01720015

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：77 / 85

页数：9

共 27 条

[1] A RESTRICTED LAGRANGEAN APPROACH TO THE TRAVELING SALESMAN PROBLEM
BALAS, E
CHRISTOFIDES, N
[J]. MATHEMATICAL PROGRAMMING, 1981, 21 (01) : 19 - 46
[2] ON INTEGER-PROGRAM FOR DELIVERY PROBLEM
BALINSKI, ML
QUANDT, RE
[J]. OPERATIONS RESEARCH, 1964, 12 (02) : 300 - &
[3] BENDERS JF, 1962, NUMER MATH, V4, P238, DOI [10.1007/BF01386316, DOI 10.1007/BF01386316, DOI 10.1007/S10287-004-0020-Y]
[4] BODIN LD, 1981, UMTABMGTMSS81001 US
[5] EXACT ALGORITHMS FOR THE VEHICLE-ROUTING PROBLEM, BASED ON SPANNING TREE AND SHORTEST-PATH RELAXATIONS
CHRISTOFIDES, N
MINGOZZI, A
TOTH, P
[J]. MATHEMATICAL PROGRAMMING, 1981, 20 (03) : 255 - 282
[6] STATE-SPACE RELAXATION PROCEDURES FOR THE COMPUTATION OF BOUNDS TO ROUTING-PROBLEMS
CHRISTOFIDES, N
MINGOZZI, A
TOTH, P
[J]. NETWORKS, 1981, 11 (02) : 145 - 164
[7] Christofides N., 1979, Combinatorial optimization, P315
[8] CHRISTOFIDES N, 1976, REV FR AUTOMAT INFOR, V10, P55
[9] SCHEDULING OF VEHICLES FROM CENTRAL DEPOT TO NUMBER OF DELIVERY POINTS
CLARKE, G
WRIGHT, JW
[J]. OPERATIONS RESEARCH, 1964, 12 (04) : 568 - &
[10] SOLUTION OF A LARGE-SCALE TRAVELING-SALESMAN PROBLEM
DANTZIG, G
FULKERSON, R
JOHNSON, S
[J]. JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF AMERICA, 1954, 2 (04): : 393 - 410