Symmetric traveling salesman problem and flows in hypergraphs: New algorithmic possibilities
DOI:
https://doi.org/10.1478/AAPP.971A1Keywords:
pedigree polytope, multistage insertion formulation, symmetric traveling salesman problem, minimum cost hypergraph flow problem, Leontief substitution flow problem, Lagrangean relaxation, Lagrangean decompositionAbstract
The traveling salesperson problem (TSP) is a very well-known NP-hard combinatorial optimization problem. Many different integer programming formulations are known for the TSP. Some of them are “compact”, in the sense of having a polynomially-bounded number of variables and constraints. We focus on one compact formulation for the symmetric TSP, known as the “multistage insertion” formulation [T. S. Arthanari, Discrete Mathematics 306, 1474 (2006)], and show that its linear programming (LP) relaxation can be viewed as a minimum-cost flow problem in a hypergraph. Using some ideas of R. Cambini, G. Gallo and M. G. Scutellà [University of Pisa, TR-1/92 (1992)] on flows in hypergraphs, we propose new algorithms to solve the LP relaxation. We also exploit the Leontief structure of a certain subproblem, to provide additional algorithms for solving the LP relaxation. Some bounds on the running time are also derived.Downloads
Published
2019-01-10
Issue
Section
Articles
License

This work is licensed under a Creative Commons Attribution 4.0 International License.
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).