AN ANALYTICAL COMPARISON OF DIFFERENT FORMULATIONS OF THE TRAVELING SALESMAN PROBLEM

被引:60
作者
PADBERG, M
SUNG, TY
机构
[1] Stern School of Business, New York University, Washington Square, New York, 10003, NY
关键词
TRAVELING SALESMAN PROBLEM; PROBLEM FORMULATIONS; CONVEX POLYHEDRAL CONES; POLYHEDRA; AFFINE TRANSFORMATIONS;
D O I
10.1007/BF01582894
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
A transformation technique is proposed that permits one to derive the linear description of the image X of a polyhedron Z under an affine linear transformation from the (given) linear description of Z This result is used to analytically compare various formulations of the asymmetric travelling salesman problem to the standard formulation due to Dantzig, Fulkerson and Johnson which are all shown to be "weaker formulations" in a precise setting. We also apply this transformation technique to "symmetrize" formulations and show, in particular, that the symmetrization of the standard asymmetric formulation results into the standard one for the symmetric version of the travelling salesman problem.
引用
收藏
页码:315 / 357
页数:43
相关论文
共 30 条
[1]  
[Anonymous], 1954, OPERATIONS RES, DOI DOI 10.1287/OPRE.2.4.393
[2]  
ARAQUE JR, 1989, THESIS SUNY STONY BR
[3]  
BACHEM A, 1982, MODERN APPLIED MATH, P51
[4]   THE PERFECTLY MATCHABLE SUBGRAPH POLYTOPE OF A BIPARTITE GRAPH [J].
BALAS, E ;
PULLEYBLANK, W .
NETWORKS, 1983, 13 (04) :495-516
[5]  
BALAS E, 1987, NOTES CORNELL U DIST
[6]  
BALAS E, 1987, MSRR538 CARN U MAN S
[7]   A NEW FORMULATION FOR THE TRAVELING SALESMAN PROBLEM [J].
CLAUS, A .
SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1984, 5 (01) :21-25
[8]  
FOX K, 1973, THESIS J HOPKINS U B
[9]   AN N-CONSTRAINT FORMULATION OF THE (TIME-DEPENDENT) TRAVELING SALESMAN PROBLEM [J].
FOX, KR ;
GAVISH, B ;
GRAVES, SC .
OPERATIONS RESEARCH, 1980, 28 (04) :1018-1021
[10]  
Garfinkel R.S., 1985, TRAVELING SALESMAN P