A CUTTING PLANES ALGORITHM FOR THE M-SALESMEN PROBLEM

被引：69

作者：

LAPORTE, G ^{[1
]}

NOBERT, Y ^{[1
]}

机构：

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

来源：

关键词：

D O I：

10.1057/jors.1980.188

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：1017 / 1023

页数：7

共 23 条

[1]

[Anonymous], 1954, OPERATIONS RES, DOI DOI 10.1287/OPRE.2.4.393

BELLMORE, M ;

HONG, S .

[3]

CARPANETO G, 1979, APR EURO3 C AMST

[4] THE TRUCK DISPATCHING PROBLEM [J].

DANTZIG, GB ;

RAMSER, JH .

[5]

DESROCHES S, 1978, INFOR, V16, P294

[6]

GAVISH B, 1979, COMMUNICATION

[7]

HANSEN KH, 1974, MATH PROG, V7, P86

[8]

Held M, 1971, MATHEMATICAL PROGRAM, V1, P6, DOI [DOI 10.1007/BF01584070, 10.1007/BF01584070]

[9] SYMMETRIC MULTIPLE TRAVELING SALESMAN PROBLEM WITH FIXED CHARGES [J].

HONG, S ;

PADBERG, MW .

[10]

Hong S., 1972, THESIS J HOPKINS U