Street Routing and Scheduling Problems-Reference-Cited by-同舟云学术

Street Routing and Scheduling Problems

Published: Issue: Volume: Page:413-449
ISSN:
Container-title:International Series in Operations Research & Management Science
language:
Short-container-title:

Author:

Bodin Lawrence,Maniezzo Vittorio,Mingozzi Aristide

Publisher

Kluwer Academic Publishers

Link

http://link.springer.com/content/pdf/10.1007/0-306-48058-1_12.pdf

Reference39 articles.

1. Augerat, P., J. M. Belenguer, E. Benavent, A. Corber’an, D. Naddef, and G. Rinaldi. (1995). Computational results with a Branch and Cut Code for the Capacitated Vehicle Routing Problem. Rapport de recherche 1 RR949-M, ARTEMIS-IMAG, Grenoble France.

2. Working paper;R. Baldacci,1998

3. Working paper;R. Baldacci,1998

4. Balinski, M and R. Quandt (1964). On an Integer Program for a Delivery Problem. Operations Research, 12, 300–304.

5. Ball, M. (1988). Allocation/routing: Models and Algorithms. In Vehicle Routing: Methods and Studies, B.L. Golden and A. Assad (eds.), North-Holland, Amsterdam.

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

1. Mixed integer formulations for a coupled lot-scheduling and vehicle routing problem in furniture settings;INFOR: Information Systems and Operational Research;2019-04-15

2. An Adaptive Iterated Local Search for the Mixed Capacitated General Routing Problem;Transportation Science;2016-06

3. Exact Algorithms for the Clustered Vehicle Routing Problem;Operations Research;2014-02

4. Models for Evaluating and Planning City Logistics Systems;Transportation Science;2009-11

5. An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts;Mathematical Programming;2007-08-01