ON SOME GENERALIZATIONS OF THE TRAVELING-SALESMAN PROBLEM

被引：21

作者：

VOLGENANT, T

JONKER, R

机构：

来源：

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY | 1987年 / 38卷 / 11期

关键词：

D O I：

10.2307/2582232

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：1073 / 1079

页数：7

共 16 条

[1] AN ALGORITHM FOR THE STEINER PROBLEM IN GRAPHS [J].

BEASLEY, JE .

NETWORKS, 1984, 14 (01) :147-159

[2] AN APPRAISAL OF SOME SHORTEST-PATH ALGORITHMS [J].

DREYFUS, SE .

OPERATIONS RESEARCH, 1969, 17 (03) :395-&

[3]

Garfinkel R. S., 1985, TRAVELING SALESMAN P

[4]

IBARAKI T, 1970, ELECTRON COMMUN JPN, V53, P10

[5] ROUNDING SYMMETRIC TRAVELING SALESMAN PROBLEMS WITH AN ASYMMETRIC ASSIGNMENT PROBLEM [J].

JONKER, R ;

DELEVE, G ;

VANDERVELDE, JA ;

VOLGENANT, A .

OPERATIONS RESEARCH, 1980, 28 (03) :623-627

[6] NONOPTIMAL EDGES FOR THE SYMMETRIC TRAVELING SALESMAN PROBLEM [J].

JONKER, R ;

VOLGENANT, T .

OPERATIONS RESEARCH, 1984, 32 (04) :837-846

[7] TRANSFORMING ASYMMETRIC INTO SYMMETRIC TRAVELING SALESMAN PROBLEMS [J].

JONKER, R ;

VOLGENANT, T .

OPERATIONS RESEARCH LETTERS, 1983, 2 (04) :161-163

[8]

JONKER R, 1986, THESIS U AMSTERDAM A

[9]

LAPORTE G, 1984, RAIRO-RECH OPER, V18, P203

[10]

Lawler E. L., 1985, TRAVELING SALESMAN P

← 1 2 →