The asymmetric travelling salesman problem and a reformulation of the Miller–Tucker–Zemlin constraints-Reference-Cited by-同舟云学术

The asymmetric travelling salesman problem and a reformulation of the Miller–Tucker–Zemlin constraints

Published:1999-01 Issue:1 Volume:112 Page:134-146
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Gouveia Luis,Pires Jose Manuel

Publisher

Elsevier BV

Subject

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

Reference16 articles.

1. Ahuja, R., Magnanti, T., Orlin, J., 1995. Network Flows: Theory, Algorithms and Applications. Prentice-Hall, New Jersey

2. Solutions of large scale travelling salesman problem;Dantzig;Operations Research,1954

3. Improvements to the Miller–Tucker–Zemlin subtour elimination constraints;Desrochers;Operation Research Letters,1991

4. Facets of the asymmetric traveling salesman problem;Fischetti;Mathematics of Operations Research,1991

5. Fischetti, M., Toth, P., 1996. A polyhedral approach to the asymmetric traveling salesman problem. Working paper

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

1. Optimizing Gas Station Control Officer Routes Using the Discrete Firefly Algorithm;2024 Intelligent Methods, Systems, and Applications (IMSA);2024-07-13

2. New strategy for anti-loop formulations;OPSEARCH;2024-04-05

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

4. Precedence constrained generalized traveling salesman problem: Polyhedral study, formulations, and branch-and-cut algorithm;European Journal of Operational Research;2023-09

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