An exact method for the double TSP with multiple stacks-Reference-Cited by-同舟云学术

An exact method for the double TSP with multiple stacks

Published:2010-02-11 Issue:5 Volume:17 Page:637-652
ISSN:0969-6016
Container-title:International Transactions in Operational Research
language:en
Short-container-title:

Author:

Lusby Richard M.,Larsen Jesper,Ehrgott Matthias,Ryan David

Publisher

Wiley

Subject

Management of Technology and Innovation,Management Science and Operations Research,Strategy and Management,Computer Science Applications,Business and International Management

Link

http://onlinelibrary.wiley.com/wol1/doi/10.1111/j.1475-3995.2009.00748.x/fullpdf

Reference13 articles.

1. An additive branch-and-bound algorithm for the pickup and delivery traveling salesman problem with LIFO or FIFO loading;Carrabs;INFOR: Information Systems and Operational Research,2007

2. A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading;Cordeau;Networks

3. Felipe , A. Ortuño , M. Tirado , G. 2008 701 706

4. K best solutions to combinatorial optimization problems;Hamacher;Annals of Operational Research,1985

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

1. Heuristic smoothing ant colony optimization with differential information for the traveling salesman problem;Applied Soft Computing;2023-01

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

3. The pickup and delivery problem with time windows, multiple stacks, and handling operations;European Journal of Operational Research;2021-11

4. 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

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