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 条
[21]  
PADBERG M, 1989, ANAL SYMMETRIZATION
[22]   EQUIVALENT KNAPSACK-TYPE FORMULATIONS OF BOUNDED INTEGER LINEAR PROGRAMS - ALTERNATIVE APPROACH [J].
PADBERG, MW .
NAVAL RESEARCH LOGISTICS, 1972, 19 (04) :699-708
[23]   TIME-DEPENDENT TRAVELING SALESMAN PROBLEM AND ITS APPLICATION TO TARDINESS PROBLEM IN ONE-MACHINE SCHEDULING [J].
PICARD, JC ;
QUEYRANNE, M .
OPERATIONS RESEARCH, 1978, 26 (01) :86-110
[24]  
SIMMONNARD M, 1966, LINEAR PROGRAMMING
[25]  
STOER J, 1970, CONVEXITY OPTIMIZATI, V1
[26]  
SUNG TY, 1988, THESIS NEW YORK U NE
[27]  
Weyl, 1950, CONTRIBUTIONS THEORY, V24, P3
[28]   STRONG FORMULATIONS FOR MIXED INTEGER PROGRAMMING - A SURVEY [J].
WOLSEY, L .
MATHEMATICAL PROGRAMMING, 1989, 45 (01) :173-191
[29]  
[No title captured]
[30]  
[No title captured]