Abstract
We introduce a projective approach for studying symmetric travelling salesman polytopes (STSPs). Thesymmetric travelling salesman polytope STSP(V) (resp.,Hamiltonian path polytope HP(V)) is the convex hull of incidence vectors of all Hamiltonian cycles (resp., paths) on the complete undirected graph with node setV. For any nodeh ∉V, HP(V) is aprojection of STSP(V ⋃ {h}). We show that HP(V) and STSP(V ⋃ {h}) are isomorphic, and HP(V) is of full dimension minus one. By this projective approach, we obtain generalclique-lifting results, all based on simple conditions, for deriving large new classes of STSP facets. These results apply to all known non-trivial STSP facets, and generalize clique-lifting results of Maurras (1975), Grötschel and Padberg (1979) and Naddef and Rinaldi (1988).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J.R. Araque G., “Contributions to the polyhedral approach to vehicle routing,” Ph.D. Thesis, State University of New York at Stony Brook (Stony Brook, NY, 1989).
E. Balas and M. Fischetti, “A lifting procedure for the asymmetric travelling salesman polytope and a large new class of facets,” MSRR No. 556, GSIA, Carnegie Mellon University (Pittsburgh, PA, 1989).
S.T. Boyd and W. Cunningham, “Ladder inequalities for symmetric travelling salesman polytopes,” Workshop on Computational Discrete Optimization at Cornell University (Ithaca, NY, 1987).
S.T. Boyd and W. Cunningham, “Small travelling salesman polytopes,” to appear inMathematics of Operations Research.
T. Christof, M. Jünger and G. Reinelt, “A complete description of the travelling salesman polytope on 8 nodes,” Report No. 249, Institut für Mathematik, Universität Augsburg (Augsburg, Germany, 1990).
G. Clark and J.W. Wright, “Scheduling of vehicles from a central depot to a number of delivery points,”Operations Research 12 (1964) 568–581.
M. Conforti, M.R. Rao and A. Sassano, “The equipartition polytope I: Formulations, dimension and basic facets,”Mathematical Programming 49 (1990) 49–70.
G. Cornuéjols, J. Fonlupt and D. Naddef, “The travelling salesman problem and some related integer polyhedra,”Mathematical Programming 33 (1985) 1–27.
G. Cornuéjols and Harche, “Polyhedral study of the capacitated vehicle routing problem,” MSRR No. 553, GSIA, Carnegie Mellon University (Pittsburgh, PA, 1989).
B. Fleischmann, “A cutting plane procedure for the travelling salesman problem on road networks,”European Journal of Operations Research 21 (1985) 307–317.
B. Fleischmann, “Cutting planes for the symmetric travelling salesman problem,” paper presented at the joint annual meeting of DGOR and NSOR (Eindhoven, Netherlands, 1987).
B. Fleischmann, “A new class of cutting planes for the symmetric travelling salesman problem,”Mathematical Programming 40 (1988) 225–246.
R.S. Garfinkel, “Motivation and modeling,” in: E.L. Lawler et al., eds.,The Travelling Salesman Problem (Wiley, New York, 1985), pp. 22–23.
P.C. Gilmore, E.L. Lawler and D.B. Shmoys, “Well-solved special cases,” in: E.L. Lawler et al., eds.,The Travelling Salesman Problem (Wiley, New York, 1985) pp. 87–143.
M. Grötschel and M.W. Padberg, “On the symmetric travelling salesman problem I: inequalities,”Mathematical Programming 16 (1979a) 265–280.
M. Grötschel and M.W. Padberg, “On the symmetric travelling salesman problem II: lifting theorems and facets,”Mathematical Programming 16 (1979b) 281–302.
M. Grötschel and M.W. Padberg, “Polyhedral theory,” in: E.L. Lawler et al., eds.,The Travelling Salesman Problem (Wiley, New York, 1985) pp. 251–305.
M. Grötschel and W.R. Pulleyblank, “Clique tree inequalities and the symmetric travelling salesman problem,”Mathematics of Operations Research 11 (1986) 537–569.
J.F. Maurras, “Some results on the convex hull of Hamiltonian cycles of symmetric complete graphs,” in: B. Roy, ed.,Combinatorial Programming: Methods and Applications (Reidel, Dordrecht, 1975) pp. 179–190.
D. Naddef, “The binested inequalities for the symmetric travelling salesman polytope,” to appear inMathematics of Operations Research.
D. Naddef and G. Rinaldi, “The graphical relaxation: a new framework for the symmetric travelling salesman polytope,”Mathematical Programming 58 (1993) 53–87, this issue.
D. Naddef and G. Rinaldi, “The symmetric travelling salesman polytope and its graphical relaxation: Composition of valid inequalities,”Mathematical Programming 51 (1991) 359–400.
D. Naddef and G. Rinaldi, “The symmetric travelling salesman polytope: New facets from the graphical relaxation,” Report R.248, IASI-CNR (Rome, Italy, 1988).
D. Naddef and G. Rinaldi, “The crown inequalities for the symmetric travelling salesman polytope,” to appear inMathematics of Operations Research.
M.W. Padberg and M. Grötschel, “Polyhedral computations,” in: E.L. Lawler et al., eds.,The Travelling Salesman Problem (Wiley, New York, 1985) pp. 307–360.
M.W. Padberg and S. Hong, “One the symmetric travelling salesman problem: a computational study,”Mathematical Programming Study 12 (1980) 78–107.
M.W. Padberg and G. Rinaldi, “Optimization of a 532-city symmetric travelling salesman problem by branch and cut,”Operations Research Letters 6 (1987) 1–7.
M.W. Padberg and G. Rinaldi, “A Branch-and-Cut algorithm for the resolution of large scale symmetric travelling salesman problems,”SIAM Review 33 (1991) 60–100.
M. Queyranne and Y. Wang, “Facet-tree compositions for the symmetric travelling salesman problem,” Working Paper 90-MSC-001, Faculty of Commerce, University of British Columbia (Vancouver, 1990).
M. Queyranne and Y. Wang, “Symmetric inequalities and their compositions for asymmetric travelling salesman polytopes,” Working Paper 90-MSC-002, Faculty of Commerce, University of British Columbia (Vancouver, 1990).
Author information
Authors and Affiliations
Additional information
This research is supported in part by a grant from the Natural Sciences and Engineering Research Council of Canada to the first author.
Rights and permissions
About this article
Cite this article
Queyranne, M., Wang, Y. Hamiltonian path and symmetric travelling salesman polytopes. Mathematical Programming 58, 89–110 (1993). https://doi.org/10.1007/BF01581260
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01581260