A set covering approach for the double traveling salesman problem with multiple stacks

DOI10.1007/978-3-319-45587-7_23MaRDI QIDQ2835682zbMATH OpenOpenAlexFDO

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

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

polytopeset coververtex coverodd holedouble traveling salesman problem with multiple stacks

Mathematics Subject Classification ID

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

Recommendations

• Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks
• Exact algorithms for the double vehicle routing problem with multiple stacks
• The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach
• Exact solutions to the double travelling salesman problem with multiple stacks
• The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches

Cites work

• A branch and cut solver for the maximum stable set problem
• A branch-and-bound algorithm for the double travelling salesman problem with two stacks
• An exact method for the double TSP with multiple stacks
• Efficient algorithms for the double traveling salesman problem with multiple stacks
• Exact solutions to the double travelling salesman problem with multiple stacks
• Exponential lower bounds for polytopes in combinatorial optimization
• Facets and lifting procedures for the set covering polytope
• Facets of the linear ordering polytope
• Improved exact method for the double TSP with multiple stacks
• Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks
• New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints
• On extended formulations for the precedence constrained asymmetric traveling salesman problem
• On the Complexity of the Multiple Stack TSP, kSTSP
• On the facial structure of set packing polyhedra
• Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks
• The Uncapacitated Asymmetric Traveling Salesman Problem with Multiple Stacks
• The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints
• 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
• The traveling salesman problem. A computational study.

Cited in

(3)

• Approximation of the double traveling salesman problem with multiple stacks
• Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks
• The double traveling salesman problem with multiple stacks: A variable neighborhood search approach

Describes a project that uses

Uses Software

• LEMON
• Concorde
• CPLEX

This page was built for publication: A set covering approach for the double traveling salesman problem with multiple stacks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2835682)