A set covering approach for the double traveling salesman problem with multiple stacks
DOI10.1007/978-3-319-45587-7_23zbMATH Open1452.90256OpenAlexW2511194182MaRDI QIDQ2835682FDOQ2835682
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
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
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Cites Work
- The traveling salesman problem. A computational study.
- On the facial structure of set packing polyhedra
- Facets and lifting procedures for the set covering polytope
- 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
- A branch and cut solver for the maximum stable set problem
- On extended formulations for the precedence constrained asymmetric traveling salesman problem
- The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
- An exact method for the double TSP with multiple stacks
- Exact solutions to the double travelling salesman problem with multiple stacks
- Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks
- The double traveling salesman problem with multiple stacks: A variable neighborhood search approach
- Efficient algorithms for the double traveling salesman problem with multiple stacks
- On the Complexity of the Multiple Stack TSP, kSTSP
- A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks
- Facets of the linear ordering polytope
- Exponential lower bounds for polytopes in combinatorial optimization
- Improved exact method for the double TSP with multiple stacks
- 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
Cited In (2)
Uses Software
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)
