THE TRAVELING SALESMAN PROBLEM - AN UPDATE OF RESEARCH

被引：21

作者：

PARKER, RG

RARDIN, RL

机构：

来源：

关键词：

D O I：

10.1002/nav.3800300107

中图分类号：

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

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：69 / 96

页数：28

共 80 条

[11] METHOD IN GRAPH THEORY [J].

BONDY, JA ;

CHVATAL, V .

[12]

Burkard R.E., 1979, DISCRETE OPTIM, V4, P193

[13]

CARPANETO G, 1977, ORSA TIMS JOINT NATI

[14] BOUNDS FOR TRAVELLING-SALESMAN PROBLEM [J].

CHRISTOFIDES, N .

[15] SHORTEST HAMILTONIAN CHAIN OF A GRAPH [J].

CHRISTOFIDES, N .

[16] ALGORITHMS FOR LARGE-SCALE TRAVELLING SALESMAN PROBLEMS [J].

CHRISTOFIDES, N ;

EILON, S .

[17]

CHRISTOFIDES N, 1975, COMBINATORIAL PROGRA

[18]

Christofides N., 1975, GRAPH THEORY ALGORIT

[19]

Christofides N., 2022, OPERATIONS RES FORUM, V3, DOI [10.1007/s43069-021-00101-z, DOI 10.1007/S43069-021-00101-Z]

[20]

Chvatal V., 1973, Mathematical Programming, V5, P29, DOI 10.1007/BF01580109