Approximability of the Multiple Stack TSP-Reference-Cited by-同舟云学术

Approximability of the Multiple Stack TSP

Published:2010-08 Issue: Volume:36 Page:813-820
ISSN:1571-0653
Container-title:Electronic Notes in Discrete Mathematics
language:en
Short-container-title:Electronic Notes in Discrete Mathematics

Author:

Toulouse Sophie

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference12 articles.

1. The double travelling salesman problem with multiple stacks - Formulation and heuristic solution approaches;Petersen;EJOR,2009

2. New neighborhood structures for the Double Traveling Salesman Problem with Multiple Stacks;Felipe;TOP,2009

3. R. Lusbyz, J. Larsenz, M. Ehrgott, D. Ryan: An Exact Method for the Double TSP with Multiple Stacks. Report 2.2009 DTU Management Engineering (2009)

4. On the complexity of the multiple stack TSP, kSTSP;Toulouse,2009

5. The Maximum Traveling Salesman Problem Under Polyhedral Norms;Barvinok,1998

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Approximation of the Double Traveling Salesman Problem with Multiple Stacks;Theoretical Computer Science;2021-07

2. Exact algorithms for the double vehicle routing problem with multiple stacks;Computers & Operations Research;2015-11

3. The traveling purchaser problem, with multiple stacks and deliveries: A branch-and-cut approach;Computers & Operations Research;2013-08

4. A Branch-and-Cut Algorithm for the Double Traveling Salesman Problem with Multiple Stacks;INFORMS Journal on Computing;2013-02

5. The Uncapacitated Asymmetric Traveling Salesman Problem with Multiple Stacks;Lecture Notes in Computer Science;2012