Compact formulations of the Steiner Traveling Salesman Problem and related problems

European Journal of Operational Research

Volumn 228, Issue 1, 2013, Pages 83-92

  Letchford, Adam N ^a   Nasiri, Saeideh D ^b   Theis, Dirk Oliver ^c  

^a LANCASTER UNIVERSITY   (United Kingdom)

^b LANCASTER UNIVERSITY   (United Kingdom)

^c OTTO VON GUERICKE UNIVERSITY   (Germany)

Author keywords

Combinatorial optimization; Integer programming; Traveling salesman problem

Indexed keywords

BRANCH AND BOUNDS; COMPACT FORMULATIONS; EXPONENTIAL NUMBERS; INTEGER PROGRAMMING FORMULATIONS; POLYNOMIAL SIZE; ROAD NETWORK; STEINER;

COMBINATORIAL OPTIMIZATION; INTEGER PROGRAMMING;

TRAVELING SALESMAN PROBLEM;

EID: 84875228397     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2013.01.044     Document Type: Article

References (31)

1. D. Applegate, R. Bixby, V. Chvátal, and W. Cook The Traveling Salesman Problem: A Computational Study 2006 Princeton University Press Princeton NJ
2. N. Ascheuer, M. Fischetti, and M. Grötschel Solving the asymmetric travelling salesman problem with time windows by branch-And-cut Math. Program. 90 2001 475 506
3. E. Balas The prize collecting traveling salesman problem Networks 19 1989 621 636
4. E. Balas The prize collecting traveling salesman problem and its applications G. Gutin, A. Punnen, The Traveling Salesman Problem and its Variations 2002 Kluwer Academic Publishers Boston 663 695
5. A. Claus A new formulation for the travelling salesman problem SIAM J. Algebra. Discr. Methods 5 1984 21 25
6. G. Cornuéjols, J. Fonlupt, and D. Naddef The travelling salesman problem on a graph and some related integer polyhedra Math. Program. 33 1985 1 27
7. G.B. Dantzig, D.R. Fulkerson, and S.M. Johnson Solution of a large-scale traveling-salesman problem Oper. Res. 2 1954 363 410
8. E.W. Dijkstra A note on two problems in connection with graphs Numer. Math. 1 1959 269 271
9. Y. Dumas, J. Desrosiers, E. Gélinas, and M.M. Solomon An optimal algorithm for the travelling salesman problem with time windows Oper. Res. 43 1995 367 371
10. L.F. Escudero An inexact algorithm for the sequential ordering problem Eur. J. Oper. Res. 37 1988 232 253
11. D. Feillet, P. Dejax, and M. Gendreau Traveling salesman problems with profits Transport. Sci. 39 2005 188 205
12. M. Fischetti, J.-J. Salazar-González, and P. Toth The generalized traveling salesman problem and orienteering problems G. Gutin, A. Punnen, The Traveling Salesman Problem and its Variations 2002 Kluwer Academic Publishers Boston 609 662
13. B. Fleischmann A cutting plane procedure for the traveling salesman problem on a road network Eur. J. Oper. Res. 21 1985 307 317
14. L.R. Ford, and D.R. Fulkerson Maximal flow through a network Can. J. Math. 8 1956 399 404
15. D. Gale A theorem of flows in networks Pacific J. Math. 7 1957 1073 1082
16. B. Gavish, S.C. Graves, The Travelling Salesman Problem and Related Problems, Working Paper, Operations Research Centre, Massachusetts Institute of Technology, 1978.
17. B.L. Golden, L. Levy, and R. Vohra The orienteering problem Nav. Res. Log. 34 1987 307 318
18. L. Gouveia, and S. Voss A classification of formulations of the (time-dependent) traveling salesman problem Eur. J. Oper. Res. 83 1995 69 82
19. W.W. Hardgrave, and G.L. Nemhauser On the relation between the traveling salesman and longest path problems Oper. Res. 10 1962 647 657
20. A. Hoffman Some recent applications of the theory of linear inequalities to external combinatorial analysis Proc. Symp. Appl. Math. vol. 10 1960 AMS Publications Providence, RI 113 128
21. D.J. Houck, J.C. Picard, and R.R. Vemuganti The traveling salesman problem as a shortest path problem: theory and computational experience Opsearch 17 1980 93 109
22. M.K. Jepsen, B. Petersen, S. Spoorendonk, D. Pisinger, A Branch-And-Cut Algorithm for the Capacitated Profitable Tour Problem. Working Paper, Technical University of Denmark, 2012.
23. A.N. Letchford, and A. Oukil Exploiting sparsity in pricing routines for the capacitated arc routing problem Comput. Oper. Res. 36 2009 2320 2327
24. P. Miliotis, G. Laporte, and Y. Nobert Computational comparison of two methods for finding the shortest complete cycle or circuit in a graph RAIRO 15 1981 233 239
25. C.E. Miller, A.W. Tucker, and R.A. Zemlin Integer programming formulations and travelling salesman problems J. Assoc. Comput. Mach. 7 1960 326 329
26. D. Naddef, Polyhedral Theory and Branch-And-Cut Algorithms for the Symmetric TSP, in: G. Gutin, A. Punnen (Eds.), The Traveling Salesman Problem and its Variations, Kluwer Academic Publishers, Boston, 2002, pp. 29-116.
27. T. Öncan, I.K. Altinel, and G. Laporte A comparative analysis of several asymmetric traveling salesman problem formulations Compt. Oper. Res. 36 2009 637 654
28. C.S. Orloff A fundamental problem in vehicle routing Networks 4 1974 35 64
29. M. Padberg, and G. Rinaldi A branch-And-cut algorithm for the resolution of large-scale symmetric traveling salesman problems SIAM Rev. 33 1991 60 100
30. M. Padberg, and T. Sung An analytical comparison of different formulations of the traveling salesman problem Math. Program. 52 1991 315 357
31. S. Vajda Mathematical Programming 1961 Addison-Wesley