A branch and bound algorithm for the capacitated vehicle routing problem-Reference-Cited by-同舟云学术

A branch and bound algorithm for the capacitated vehicle routing problem

Published:1983-06 Issue:2 Volume:5 Page:77-85
ISSN:0171-6468
Container-title:Operations-Research-Spektrum
language:en
Short-container-title:OR Spektrum

Author:

Laporte G.,Nobert Y.

Publisher

Springer Science and Business Media LLC

Subject

Management Science and Operations Research,Business, Management and Accounting (miscellaneous)

Link

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

Reference27 articles.

1. Balas E, Christofides N (1981) A restricted lagrangean approach to the travelling salesman problem. Math Programming 21:19–46

2. Balinski M, Quandt R (1964) On an integer program for a delivery problem. Oper Res 12:300–304

3. Benders JF (1962) Partitioning procedures for solving mixed-variables programming problems. Numer Math 4:238–252

4. Bodin LD, Golden BL, Assad A, Ball M (1981) The state of the art in routing and scheduling of vehicles and crews. Report No. UMTA/BMGT/MSS # 81-001, US Department of Trasnportation, Washington, DC

5. Christofides N (1976) The vehicle routing problem. RAIRO (Rech Operat) 10:55–70

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

1. Smart Routes: A System for Development and Comparison of Algorithms for Solving Vehicle Routing Problems with Realistic Constraints;Автоматика и телемеханика;2024-12-15

2. A Unified Branch-Price-and-Cut Algorithm for Multicompartment Pickup and Delivery Problems;Transportation Science;2024-08-12

3. Hardness of Pricing Routes for Two-Stage Stochastic Vehicle Routing Problems with Scenarios;Operations Research;2024-07-16

4. Generalized Riskiness Index in Vehicle Routing Under Uncertain Travel Times: Formulations, Properties, and Exact Solution Framework;Transportation Science;2024-07

5. Exact and Heuristic Methods for the Split Delivery Vehicle Routing Problem;Transportation Science;2024-07