Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks

DOI10.1016/j.disopt.2016.04.005zbMath1387.90029OpenAlexW2410403400MaRDI QIDQ1751162

Roland Grappe, Roberto Wolfler Calvo, Mathieu Lacroix, Michele Barbato

Publication date: 24 May 2018

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2016.04.005

zbMATH Keywords

traveling salesman problembranch-and-cutpolyhedral studymultiple stacks

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Related Items (6)

Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks ⋮ The double traveling salesman problem with partial last‐in‐first‐out loading constraints ⋮ A metaheuristic for the double traveling salesman problem with partial last‐in‐first‐out loading constraints ⋮ A variable neighborhood search heuristic algorithm for the double vehicle routing problem with multiple stacks ⋮ Approximation of the double traveling salesman problem with multiple stacks ⋮ A Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks

Uses Software

• CPLEX
• COIN-OR

Cites Work

• Unnamed Item
• Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem
• The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
• On the facial structure of the set covering polytope
• Geometric algorithms and combinatorial optimization
• Efficient algorithms for the double traveling salesman problem with multiple stacks
• New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints
• Exponential Lower Bounds for Polytopes in Combinatorial Optimization
• An exact method for the double TSP with multiple stacks
• Exact solutions to the double travelling salesman problem with multiple stacks
• Improved exact method for the double TSP with multiple stacks
• The Uncapacitated Asymmetric Traveling Salesman Problem with Multiple Stacks
• On the Complexity of the Multiple Stack TSP, kSTSP
• Facets of the linear ordering polytope
• A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
• Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks
• A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
• A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks
• Solution of a Large-Scale Traveling-Salesman Problem
• On extended formulations for the precedence constrained asymmetric traveling salesman problem
• The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints

This page was built for publication: Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks