SOME NEW BRANCHING AND BOUNDING CRITERIA FOR THE ASYMMETRIC TRAVELING SALESMAN PROBLEM

被引：119

作者：

CARPANETO, G

TOTH, P

机构：

来源：

关键词：

D O I：

10.1287/mnsc.26.7.736

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：736 / 743

页数：8

共 7 条

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

BELLMORE, M ;

MALONE, JC .

[2] SOLUTION OF THE ASSIGNMENT PROBLEM [H] [J].

CARPANETO, G ;

TOTH, P .

ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1980, 6 (01) :104-111

GARFINKEL, RS .

[4] AN ALGORITHM FOR THE TRAVELING SALESMAN PROBLEM [J].

LITTLE, JDC ;

MURTY, KG ;

SWEENEY, DW ;

KAREL, C .

[5]

SMITH THC, 1977, ANN DISCRETE MATH, V1, P495

[6]

SRINIVASAN V, 1972, NAV RES LOG, V19, P205, DOI 10.1002/nav.3800190202

SRINIVASAN, V ;

THOMPSON, GL .