BOUNDS FOR TRAVELLING-SALESMAN PROBLEM

被引：30

作者：

CHRISTOFIDES, N

机构：

来源：

OPERATIONS RESEARCH | 1972年 / 20卷 / 05期

关键词：

D O I：

10.1287/opre.20.5.1044

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：1044 / +

页数：1

共 12 条

[1]

Berge C., 1962, THEORY GRAPHS

[2]

CHRISTOFIDES N, 1970, J SIAM, V19, P689

[3]

CHRISTOFIDES N, 1969, 6911 IMP COLL REP

[4]

Eilon S., 1971, DISTRIBUTION MANAGEM

[5] A DYNAMIC PROGRAMMING APPROACH TO SEQUENCING PROBLEMS [J].

HELD, M ;

KARP, RM .

JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1962, 10 (01) :196-210

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

HELD, M ;

KARP, RM .

OPERATIONS RESEARCH, 1970, 18 (06) :1138-&

[7]

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

[8] COMPUTER SOLUTIONS OF TRAVELING SALESMAN PROBLEM [J].

LIN, S .

BELL SYSTEM TECHNICAL JOURNAL, 1965, 44 (10) :2245-+

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

LITTLE, JDC ;

MURTY, KG ;

SWEENEY, DW ;

KAREL, C .

OPERATIONS RESEARCH, 1963, 11 (06) :972-989

[10] SPANNING TREE MANIPULATION AND TRAVELLING SALESMAN PROBLEM [J].

OBRUCA, AK .

COMPUTER JOURNAL, 1968, 10 (04) :374-&

← 1 2 →