Probabilistic analysis of the capacitated vehicle routing problem with unsplit demands

Authors:
Julien Bramel;Edward G. Coffman, Jr.;Peter W. Schor;David Simchi-Levi
Affiliations:
-;-;-;-
Venue:
Operations Research
Year:
1992

Citing 0
Cited 4

Set-covering-based algorithms for the capacitated VRP

The vehicle routing problem
Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines

Computers and Operations Research
The train delivery problem: vehicle routing meets bin packing

WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Approximate algorithms with estimates for routing problems on random inputs with a bounded number of customers per route

Automation and Remote Control

Quantified Score

Hi-index	0.00

Visualization

Abstract