A Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks

DOI10.1007/978-3-319-45587-7_23zbMath1452.90256OpenAlexW2511194182MaRDI QIDQ2835682

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

Publication date: 30 November 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-45587-7_23

zbMATH Keywords

polytopevertex coverset coverodd holedouble traveling salesman problem with multiple stacks

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Uses Software

• CPLEX
• Concorde
• LEMON

Cites Work

• Unnamed Item
• A branch and cut solver for the maximum stable set problem
• The double traveling salesman problem with multiple stacks: A variable neighborhood search approach
• The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
• Facets and lifting procedures for the set covering polytope
• Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks
• Efficient algorithms for the double traveling salesman problem with multiple stacks
• The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints
• 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
• Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks
• On the facial structure of set packing polyhedra
• A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks
• On extended formulations for the precedence constrained asymmetric traveling salesman problem

This page was built for publication: A Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks