Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs
From MaRDI portal
Publication:2384394
DOI10.1016/j.dam.2007.05.014zbMath1144.90469OpenAlexW1965779657MaRDI QIDQ2384394
Publication date: 21 September 2007
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2007.05.014
Lagrangean relaxationtravelling salesmanbranch-and-bound methodcombinatorial optimisationpolyhedral analysis
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items (5)
A polyhedral study of the cardinality constrained multi-cycle and multi-chain problem on directed graphs ⋮ On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches ⋮ Solving shortest path problems with a weight constraint and replenishment arcs ⋮ Counting feasible solutions of the traveling salesman problem with pickups and deliveries is \#\(P\)-complete ⋮ Facets of the polytope of the asymmetric travelling salesman problem with replenishment arcs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An additive bounding procedure for the asymmetric travelling salesman problem
- A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems
- Conditional subgradient optimization -- theory and applications
- A heuristic algorithm for the asymmetric capacitated vehicle routing problem
- An optimal solution procedure for the multiple tour maximum collection problem using column generation
- A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships
- The aircraft rotation problem
- The asymmetric traveling salesman problem with replenishment arcs
- The traveling salesman problem and its variations
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- Flight String Models for Aircraft Fleeting and Routing
- Integer Programming Formulation of Traveling Salesman Problems
- A LIFO implicit enumeration algorithm for the asymmetric travelling salesman problem using a one-arborescence relaxation
- Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
- A restricted Lagrangean approach to the traveling salesman problem
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- Exact solution of large-scale, asymmetric traveling salesman problems
- A Polyhedral Approach to the Asymmetric Traveling Salesman Problem
- A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows
- A polyhedral study of the asymmetric traveling salesman problem with time windows
- Solution of a Large-Scale Traveling-Salesman Problem
- Minimization of unsmooth functionals
- Technical Note—On Partitioning the Feasible Set in a Branch-and-Bound Algorithm for the Asymmetric Traveling-Salesman Problem
- Integer Programming and Combinatorial Optimization
- Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
This page was built for publication: Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs
