TRAVELING SALESMAN PROBLEM - DUALITY APPROACH

被引：12

作者：

BAZARAA, MS ^{[1
]}

GOODE, JJ ^{[1
]}

机构：

[1] GEORGIA INST TECHNOL,ATLANTA,GA 30332

来源：

关键词：

D O I：

10.1007/BF01584338

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：221 / 237

页数：17

共 13 条

[1]

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

[2] USE OF FICTITIOUS BOUNDS IN TREE SEARCH ALGORITHMS [J].

BAZARAA, MS ;

ELSHAFEI, AN .

[3]

BAZARAA MS, 1974, SURVEY VARIOUS TACTI

[4] PATHOLOGY OF TRAVELING-SALESMAN SUBTOUR-ELIMINATION ALGORITHMS [J].

BELLMORE, M ;

MALONE, JC .

[5]

Dijkstra E., 1959, NUMER MATH, V1, P269

[6]

FISHER ML, 1975, MATHEMATICAL PROGRAM, V3, P56

[7]

Geoffrion A., 1974, MATH PROGRAMMING STU, V2, DOI [10.1007/BFb0120690, DOI 10.1007/BFB0120686]

[8]

HANSEN KH, 1974, MATH PROGRAM, V7, P87

[9]

Held M., 1974, Mathematical Programming, V6, P62, DOI 10.1007/BF01580223

[10] TRAVELING-SALESMAN PROBLEM AND MINIMUM SPANNING TREES [J].

HELD, M ;

KARP, RM .