Requiem for the Miller–Tucker–Zemlin subtour elimination constraints?-Reference-Cited by-同舟云学术

Requiem for the Miller–Tucker–Zemlin subtour elimination constraints?

Published:2014-08 Issue:3 Volume:236 Page:820-832
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Bektaş Tolga,Gouveia Luis

Publisher

Elsevier BV

Subject

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

Reference24 articles.

1. Christof, T., & Löbel, A. (2004). PORTA: POlyhedron Representation Transformation Algorithm. .

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

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

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

5. Gavish, B., & Graves, S. C. (1978). The traveling salesman problem and related problems. Working Paper GR-078-78, Operations Research Center, Massachusetts Institute of Technology.

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

1. General VNS for asymmetric vehicle routing problem with time and capacity constraints;Computers & Operations Research;2024-07

2. Fleet resupply by drones for last-mile delivery;European Journal of Operational Research;2024-07

3. Mathematical formulations for consistent travelling salesman problems;European Journal of Operational Research;2024-03

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

5. The profit-oriented hub line location problem with elastic demand;Computers & Operations Research;2023-11