Facets of the Asymmetric Traveling Salesman Polytope
From MaRDI portal
Publication:3971736
Recommendations
- A Polyhedral Approach to the Asymmetric Traveling Salesman Problem
- Facets of the polytope of the asymmetric travelling salesman problem with replenishment arcs
- A lifting procedure for asymmetric traveling salesman polytope and a large new class of facets
- The Graphical Asymmetric Traveling Salesman Polyhedron: Symmetric Inequalities
- Facet identification for the symmetric traveling salesman polytope
- An analysis of the asymmetric quadratic traveling salesman polytope
- The facets of the asymmetric 5-city traveling salesman polytope
- Symmetric Inequalities and Their Composition for Asymmetric Travelling Salesman Polytopes
- On the facial structure of symmetric and graphical traveling salesman polyhedra
- A procedure of facet composition for the Symmetric Traveling Salesman Polytope
Cited in
(36)- New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP
- Short combinatorial proof that the DFJ polytope is contained in the MTZ polytope for the asymmetric traveling salesman problem
- Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups.
- scientific article; zbMATH DE number 3924538 (Why is no real title available?)
- scientific article; zbMATH DE number 3943559 (Why is no real title available?)
- Signed orders, choice probabilities, and linear polytopes
- Improved Computational Approaches and Heuristics for Zero Forcing
- A lifting procedure for asymmetric traveling salesman polytope and a large new class of facets
- A polyhedral study of the asymmetric traveling salesman problem with time windows
- Facets of the polytope of the asymmetric travelling salesman problem with replenishment arcs
- A lexicographic semiorder polytope and probabilistic representations of choice
- Complete linear descriptions of small asymmetric traveling salesman polytopes
- Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
- Efficient cuts in Lagrangean `relax-and-cut' schemes
- SelfSplit parallelization for mixed-integer linear programming
- A polyhedral study of the cardinality constrained multi-cycle and multi-chain problem on directed graphs
- Facets and rank of integer polyhedra
- A branch-and-cut framework for the consistent traveling salesman problem
- Asymmetric multidepot vehicle routing problems: valid inequalities and a branch-and-cut algorithm
- Facets of two Steiner arborescence polyhedra
- Induced binary probabilities and the linear ordering polytope: A status report
- The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints
- Facet generating techniques
- Facets of the (s,t)-p-path polytope
- The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints
- The Fixed-Outdegree 1-Arborescence Polytope
- Requiem for the Miller-Tucker-Zemlin subtour elimination constraints?
- The facets of the asymmetric 5-city traveling salesman polytope
- On symmetric subtour problems
- Combined route capacity and route length models for unit demand vehicle routing problems
- The precedence-constrained asymmetric traveling salesman polytope
- Exact methods for solving the elementary shortest and longest path problems
- Survey of facial results for the traveling salesman polytope
- scientific article; zbMATH DE number 1517142 (Why is no real title available?)
- On the Asymmetric Connected Facility Location Polytope
- Clique tree inequalities define facets of the asymmetric traveling salesman polytope
This page was built for publication: Facets of the Asymmetric Traveling Salesman Polytope
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3971736)
