Differential approximation of the multiple stacks TSP

DOI10.1007/978-3-642-32147-4_36zbMATH Open1370.90229OpenAlexW2249235300MaRDI QIDQ3167643FDOQ3167643

Sophie Toulouse

Publication date: 2 November 2012

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

Full work available at URL: https://doi.org/10.1007/978-3-642-32147-4_36

Recommendations

• Approximability of the multiple stack TSP
• Approximation of the double traveling salesman problem with multiple stacks
• On the Complexity of the Multiple Stack TSP, kSTSP
• The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
• Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks

zbMATH Keywords

approximation algorithmsdifferential approximationmultiple stacks TSPtravelling saleman problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25) Transportation, logistics and supply chain management (90B06)

Cited In (2)

• Approximation of the double traveling salesman problem with multiple stacks
• On the Complexity of the Multiple Stack TSP, kSTSP

This page was built for publication: Differential approximation of the multiple stacks TSP

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