A dynamic programming based local search approach for the double traveling salesman problem with multiple stacks-Reference-Cited by-同舟云学术

A dynamic programming based local search approach for the double traveling salesman problem with multiple stacks

Published:2013-10-18 Issue:1 Volume:22 Page:61-75
ISSN:0969-6016
Container-title:International Transactions in Operational Research
language:en
Short-container-title:Intl. Trans. in Op. Res.

Author:

Urrutia Sebastián¹,Milanés Anolan²,Løkketangen Arne²

Affiliation:

1. Department of Computer Science; University of Minas Gerais; Belo Horizonte Brazil

2. Department of Informatics, Molde University College; Molde Norway

Publisher

Wiley

Subject

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

Reference22 articles.

1. A branch-and-cut algorithm for the double traveling salesman problem with multiple stacks;Alba Martínez;INFORMS Journal of Computing,2013

2. A branch-and-bound algorithm for the double tsp with two stacks;Carrabs;Networks,2013

3. Efficient algorithms for the double traveling salesman problem with multiple stacks;Casazza;Computers & OR,2012

4. A math-heuristic for the multi-level capacitated lot sizing problem with carryover;Caserta;Lecture Notes in Computer Science,2010

5. A math-heuristic algorithm for the DNA sequencing problem;Caserta;Lecture Notes in Computer Science,2010

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

1. Hybrid Arithmetic-Rider Optimization algorithm as new intelligent model for travelling salesman problem;International Journal of Information Technology;2024-02-15

2. Hybrid Arithmetic-Rider Optimization Algorithm as New Intelligent Model for Travelling Salesman Problem;2022-09-30

3. Cooperation and profit allocation for two-echelon logistics pickup and delivery problems with state–space–time networks;Applied Soft Computing;2021-09

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