The Binested Inequalities for the Symmetric Traveling Salesman Polytope
From MaRDI portal
Publication:4027789
DOI10.1287/moor.17.4.882zbMath0770.90074MaRDI QIDQ4027789
Publication date: 1 March 1993
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.17.4.882
valid inequalities; comb inequalities; clique tree inequalities; symmetric travelling salesman polytope; hyperstar inequalities; path inequalities
90C35: Programming involving graphs or networks
52B12: Special polytopes (linear programming, centrally symmetric, etc.)
Related Items
The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities, Survey of facial results for the traveling salesman polytope, Hamiltonian path and symmetric travelling salesman polytopes, The general routing polyhedron: A unifying framework, The 2-edge-connected subgraph polyhedron