Polyhedral study of the capacitated vehicle routing problem-Reference-Cited by-同舟云学术

Polyhedral study of the capacitated vehicle routing problem

Published:1993-06 Issue:1-3 Volume:60 Page:21-52
ISSN:0025-5610
Container-title:Mathematical Programming
language:en
Short-container-title:Mathematical Programming

Author:

Cornuejols Gerard,Harche Farid

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Software

Link

http://link.springer.com/content/pdf/10.1007/BF01580599.pdf

Reference32 articles.

1. Working paper;J.R. Araque,1989

2. L.D. Bodin, B.L. Golden, A. Assad and M. Ball, “Routing and scheduling of vehicles and crews, the state of the art,”Computers and Operations Research 10 (1983) 69–211.

3. V. Campos, A. Corberan and E. Mota, “Polyhedral results for a vehicle routing problem,”European Journal of Operational Research 52 (1991) 75–85.

4. N. Christofides, “Vehicle routing,” in: E.L. Lawler, J.K. Lenstra, A.H.G. Rinnoy Kan and D.B. Shmoys, eds.,The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization (Wiley, New York, 1985).

5. N. Christofides and S. Eilon, “An algorithm for the vehicle dispatching problem,”Operations Research Quarterly 20 (1969) 309–318.

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

1. A Unifying Framework for the Capacitated Vehicle Routing Problem Under Risk and Ambiguity;Operations Research;2023-11-22

2. A heterogeneous vehicle routing problem with common carriers and time regulations: Mathematical formulation and a two-color ant colony search;Computers & Industrial Engineering;2022-06

3. A MAS approach for vehicle routing problem;Neural Computing and Applications;2022-01-08

4. A branch-and-cut algorithm for an assembly routing problem;European Journal of Operational Research;2020-05

5. References;Fundamentals of Supply Chain Theory;2019-06-28