Clique Tree Inequalities and the Symmetric Travelling Salesman Problem
From MaRDI portal
Publication:3030581
DOI10.1287/moor.11.4.537zbMath0626.90060OpenAlexW2161305900WikidataQ96162086 ScholiaQ96162086MaRDI QIDQ3030581
William R. Pulleyblank, Martin Grötschel
Publication date: 1986
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.11.4.537
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Integer programming (90C10) Polytopes and polyhedra (52Bxx)
Related Items
A lifting procedure for asymmetric traveling salesman polytope and a large new class of facets, Clique tree inequalities define facets of the asymmetric traveling salesman polytope, Ordered colourings, New techniques for cost sharing in combinatorial optimization games, The pickup and delivery problem: Faces and branch-and-cut algorithm, Incorporating facet-inducing inequalities into graphical-construct-based Lagrangian relaxation methodologies, On cutting-plane proofs in combinatorial optimization, A note on the polytope of bipartite TSP, Separating clique tree and bipartition inequalities in polynomial time, Complexity of branch-and-bound and cutting planes in mixed-integer optimization, Facet Generating Techniques, On facet-inducing inequalities for combinatorial polytopes, Facet identification for the symmetric traveling salesman polytope, Chvátal closures for mixed integer programming problems, The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities, An extended approach for lifting clique tree inequalities, Polyhedral study of the capacitated vehicle routing problem, On symmetric subtour problems, Branch and cut methods for network optimization, Certification of an optimal TSP tour through 85,900 cities, A Polyhedral Study of the Quadratic Traveling Salesman Problem, The graphical relaxation: A new framework for the symmetric traveling salesman polytope, Hamiltonian path and symmetric travelling salesman polytopes, The general routing polyhedron: A unifying framework, The 2-edge-connected subgraph polyhedron, Survey of facial results for the traveling salesman polytope, Optimizing over the subtour polytope of the travelling salesman problem, Solution of large-scale symmetric travelling salesman problems, Light on the infinite group relaxation. I: Foundations and taxonomy
