Facets of the Asymmetric Traveling Salesman Polytope
From MaRDI portal
Publication:3971736
DOI10.1287/moor.16.1.42zbMath0742.90079MaRDI QIDQ3971736
Publication date: 25 June 1992
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.16.1.42
valid inequalities; facial structure; facet-defining inequality; asymmetric traveling salesman polytope; Steiner arborescence polytope
90C35: Programming involving graphs or networks
52B12: Special polytopes (linear programming, centrally symmetric, etc.)
05C38: Paths and cycles
Related Items
Unnamed Item, Unnamed Item, The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints, Combined route capacity and route length models for unit demand vehicle routing problems, Facets of two Steiner arborescence polyhedra, Induced binary probabilities and the linear ordering polytope: A status report, On symmetric subtour problems, Efficient cuts in Lagrangean `relax-and-cut' schemes, Clique tree inequalities define facets of the asymmetric traveling salesman polytope, Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups., Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems, Survey of facial results for the traveling salesman polytope, Signed orders, choice probabilities, and linear polytopes, The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints, Complete linear descriptions of small asymmetric traveling salesman polytopes, A lifting procedure for asymmetric traveling salesman polytope and a large new class of facets, New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP, Facets of the polytope of the asymmetric travelling salesman problem with replenishment arcs
