Efficient algorithms for the double traveling salesman problem with multiple stacks-Reference-Cited by-同舟云学术

Efficient algorithms for the double traveling salesman problem with multiple stacks

Published:2012-05 Issue:5 Volume:39 Page:1044-1053
ISSN:0305-0548
Container-title:Computers & Operations Research
language:en
Short-container-title:Computers & Operations Research

Author:

Casazza Marco,Ceselli Alberto,Nunkesser Marc

Publisher

Elsevier BV

Subject

Management Science and Operations Research,Modelling and Simulation,General Computer Science

Reference29 articles.

1. Network flows: theory, algorithms and applications;Ahuja,1993

2. A branch-and-cut algorithm for the double travelling salesman problem with multiple stacks;Alba,2010

3. Applegate D, Bixby R, Chvatal V, Cook W. Concorde documentation. 〈http://www.tsp.gatech.edu/concorde/index.html〉; 2009 [Last access november 2009].

4. Modern graph theory;Bollobás,1998

5. On improved time bounds for permutation graph problems;Brandstädt,1992

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

1. A metaheuristic for the double traveling salesman problem with partial last‐in‐first‐out loading constraints;International Transactions in Operational Research;2022-08-02

2. Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks;European Journal of Operational Research;2021-08

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

4. Additive Bounds for the Double Traveling Salesman Problem with Multiple Stacks;AIRO Springer Series;2021

5. A Double Traveling Salesman Problem With Three-Dimensional Loading Constraints for Bulky Item Delivery;IEEE Access;2021