An alternate formulation of the symmetric traveling salesman problem and its properties

Discrete Applied Mathematics

Volumn 98, Issue 3, 2000, Pages 173-190

  Arthanari, T S ^a   Usha, M ^a  

^a INDIAN STATISTICAL INSTITUTE   (India)

Author keywords

Problem formulations; Subtour elimination polytope; Traveling salesman problem

Indexed keywords

EID: 0003110035     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(99)00154-7     Document Type: Article

References (9)

1. T.S. Arthanari, On the traveling salesman problem, Presented at the XI Symposium on Mathematical Programming held at Bonn, West Germany, 1982.
2. T.S. Arthanari, M. Usha, Equivalence of U(n) and SEP(n) and its implications, Preprint, communicated for publication, 1997.
3. Bellman R.E. Dynamic programming treatment of the travelling salesman problem. J. Assoc. Comput. Mach. 9:1962;61-63.
4. Dantzig G., Fulkerson D., Johnson S. Solution of a large scale traveling salesman problem. Oper. Res. 2:1954;393-410.
5. Gouveia L., Voß S. A classification of formulations for the (time-dependent) traveling salesman problem. Eur. J. Oper. Res. 83:1995;69-82.
6. Held M., Karp R.M. A dynamic programming approach to sequencing problems. SIAM Appl. Math. 10:1962;196-210.
7. M. Junger et al., The traveling salesman problem, Handbooks in OR & MS, Vol. 7, Elseiver Science, Amsterdam, 1995.
8. E. Lawler et al. (eds)., The traveling salesman problem, Wiley, New York, 1985.
9. Padberg M., Sung T.Y. An analytical comparison of different formulations of the traveling salesman problem. Math. Prog. 52:1991;315-357.