Approximability of the multiple stack TSP

MaRDI QIDQ2861493zbMATH OpenFDO

Authors Sophie Toulouse

Publication date 8 November 2013

Full work available at URL https://arxiv.org/abs/1009.5030, http://www.sciencedirect.com/science/article/pii/S1571065310001046

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Differential approximation of the multiple stacks TSP
• On the Complexity of the Multiple Stack TSP, kSTSP
• Approximation of the double traveling salesman problem with multiple stacks
• On approximating multicriteria \textsc{TSP}
• The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches

Cites work

• 8/7-approximation algorithm for (1,2)-TSP
• Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• scientific article; zbMATH DE number 1187152 (Why is no real title available?)
• Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems
• Improved approximation algorithms for metric MaxTSP
• Improved deterministic approximation algorithms for max TSP
• New neighborhood structures for 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
• The Traveling Salesman Problem with Distances One and Two

Cited in

(8)

• An approximation algorithm for the stack-up problem
• Approximation of the double traveling salesman problem with multiple stacks
• A 3/2-approximation algorithm for the multiple TSP with a fixed number of depots
• Differential approximation of the multiple stacks TSP
• The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach
• Exact algorithms for the double vehicle routing problem with multiple stacks
• On the Complexity of the Multiple Stack TSP, kSTSP
• Approximating TSP Solution by MST Based Graph Pyramid

This page was built for publication: Approximability of the multiple stack TSP

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