Models and algorithms for the Asymmetric Traveling Salesman Problem: an experimental comparison-Reference-Cited by-同舟云学术

Models and algorithms for the Asymmetric Traveling Salesman Problem: an experimental comparison

Published:2012-06 Issue:1-2 Volume:1 Page:113-133
ISSN:2192-4376
Container-title:EURO Journal on Transportation and Logistics
language:en
Short-container-title:EURO Journal on Transportation and Logistics

Author:

Roberti Roberto,Toth Paolo

Publisher

Elsevier BV

Subject

Management Science and Operations Research,Transportation,Modeling and Simulation

Link

http://link.springer.com/content/pdf/10.1007/s13676-012-0010-0.pdf

Reference65 articles.

1. Applegate D, Bixby R, Chvátal V, Cook W (1999) Concorde—a code for solving traveling salesman problems. http://www.tsp.gatech.edu/concorde/index.html

2. The traveling salesman problem: a computational study;Applegate,2007

3. The asymmetric assignment problem and some new facets of the traveling salesman polytope on a directed graph;Balas;SIAM J Discret Math,1989

4. Balas E (2000) Personal communication

5. A restricted Lagrangian approach to the traveling salesman problem;Balas;Math Program Ser A,1981

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

1. Quasi-linear time heuristic to solve the Euclidean traveling salesman problem with low gap;Journal of Computational Science;2024-10

2. Retrieval optimization in a warehouse with multiple input/output-points;OR Spectrum;2024-06-18

3. Energy-aware UAV Parcel Delivery Assignment;2024 7th International Balkan Conference on Communications and Networking (BalkanCom);2024-06-03

4. A survey on the Traveling Salesman Problem and its variants in a warehousing context;European Journal of Operational Research;2024-04

5. MILP models of a patient transportation problem;Central European Journal of Operations Research;2024-02-19