Exact algorithms for the traveling salesman problem with draft limits-Reference-Cited by-同舟云学术

Exact algorithms for the traveling salesman problem with draft limits

Published:2014-05 Issue:1 Volume:235 Page:115-128
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Battarra Maria,Pessoa Artur Alves,Subramanian Anand,Uchoa Eduardo

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference14 articles.

1. The time dependent traveling salesman problem: Polyhedra and algorithm;Abeledo;Mathematical Programming Computation,2013

2. Polyhedral theory for the asymmetric traveling salesman problem;Balas,2004

3. New route relaxation and pricing strategies for the vehicle routing problem;Baldacci;Operations Research,2011

4. Solution of a large-scale traveling-salesman problem;Dantzig;Operations Research,1954

5. An n-constraint formulation of the (time-dependent) traveling salesman problem;Fox;Operations Research,1980

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

1. Genetic algorithm to the bi-objective multiple travelling salesman problem;Alexandria Engineering Journal;2024-03

2. Tramp ship routing and speed optimization with tidal berth time windows;Transportation Research Part E: Logistics and Transportation Review;2023-10

3. Tight lower bounds for the Traveling Salesman Problem with draft limits;Computers & Operations Research;2023-06

4. The Heterogeneous Fleet Vehicle Routing Problem with Draft Limits;Computers & Operations Research;2023-01

5. Exploiting Genetic and Memetic Algorithms to Solve the Traveling Salesman Problem with Draft Limits;Proceedings of the 11th International Conference on Production Research – Americas;2023