A comparative analysis of several asymmetric traveling salesman problem formulations-Reference-Cited by-同舟云学术

A comparative analysis of several asymmetric traveling salesman problem formulations

Published:2009-03 Issue:3 Volume:36 Page:637-654
ISSN:0305-0548
Container-title:Computers & Operations Research
language:en
Short-container-title:Computers & Operations Research

Author:

Öncan Temel,Altınel İ. Kuban,Laporte Gilbert

Publisher

Elsevier BV

Subject

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

Reference28 articles.

1. The Euclidean traveling salesman problem is NP-complete;Papadimitriou;Theoretical Computer Science,1977

2. The perfectly matchable subgraph polytope of a bipartite graph;Balas;Networks,1983

3. Wong RT. Integer programming formulations of the traveling salesman problem. Proceedings of the IEEE international conference of circuits and computers, 1980. p. 149–52.

4. An analytical comparison of different formulations of the travelling salesman problem;Padberg;Mathematical Programming,1991

5. Classification of travelling salesman problem formulations;Langevin;Operations Research Letters,1990

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

1. Classification and comparison of integer programming formulations for the single-machine sequencing problem;Computers & Operations Research;2025-01

2. Optimizing the long-term costs of an Inventory Routing Problem using linear relaxation;Transportation Research Part E: Logistics and Transportation Review;2024-03

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

4. Formulations for the clustered traveling salesman problem with d-relaxed priority rule;Computers & Operations Research;2024-01

5. Synchromodal freight transport re-planning under service time uncertainty: An online model-assisted reinforcement learning;Transportation Research Part C: Emerging Technologies;2023-11