Clique Tree Inequalities and the Symmetric Travelling Salesman Problem

Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Integer programming (90C10) Polytopes and polyhedra (52Bxx)

Cited In (31)

Light on the infinite group relaxation. I: Foundations and taxonomy
Polyhedral study of the capacitated vehicle routing problem
Hamiltonian path and symmetric travelling salesman polytopes
The graphical relaxation: A new framework for the symmetric traveling salesman polytope
The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities
The 2-edge-connected subgraph polyhedron
Separating clique tree and bipartition inequalities in polynomial time
On cutting-plane proofs in combinatorial optimization
The Crown Inequalities for the Symmetric Traveling Salesman Polytope
A lifting procedure for asymmetric traveling salesman polytope and a large new class of facets
The pickup and delivery problem: Faces and branch-and-cut algorithm
A Polyhedral Study of the Quadratic Traveling Salesman Problem
Complexity of branch-and-bound and cutting planes in mixed-integer optimization
Facet identification for the symmetric traveling salesman polytope
Certification of an optimal TSP tour through 85,900 cities
Optimizing over the subtour polytope of the travelling salesman problem
Incorporating facet-inducing inequalities into graphical-construct-based Lagrangian relaxation methodologies
Ordered colourings
Solution of large-scale symmetric travelling salesman problems
Chvátal closures for mixed integer programming problems
A note on the polytope of bipartite TSP
Branch and cut methods for network optimization
The general routing polyhedron: A unifying framework
On facet-inducing inequalities for combinatorial polytopes
An extended approach for lifting clique tree inequalities
On symmetric subtour problems
Facet Generating Techniques
Finding triangle-free 2-factors in general graphs
Survey of facial results for the traveling salesman polytope
New techniques for cost sharing in combinatorial optimization games
Clique tree inequalities define facets of the asymmetric traveling salesman polytope

This page was built for publication: Clique Tree Inequalities and the Symmetric Travelling Salesman Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3030581)