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 条

[11]

LAND AH, 1979, 10TH INT S MATH PROG

[12]

LAND AH, 1973, FORTRAN CODES MATH P

[13]

LAPORTE G, 1980, EUR J OPS RES

[14]

LAPORTE G, J COMP APPL MATH, V4, P259

[15] SOME SIMPLE APPLICATIONS OF TRAVELING SALESMAN PROBLEM [J].

LENSTRA, JK ;

RINNOOYKAN, AHG .

[16]

MARTIN GT, 1966, SOLVING TRAVELING SA

MILIOTIS, P .

[18] INTEGER PROGRAMMING APPROACHES TO TRAVELING SALESMAN PROBLEM [J].

MILIOTIS, P .

[19] DIRECT SEARCH ALGORITHMS FOR TRUCK-DISPATCHING PROBLEMS .I. [J].

PIERCE, JF .

TRANSPORTATION RESEARCH, 1969, 3 (01) :1-&

[20]

SMITH THC, 1977, STUDIES INTEGER PROG, V1