Probabilistic Analysis of the Capacitated Vehicle Routing Problem with Unsplit Demands

DOI10.1287/opre.40.6.1095zbMath0770.90022OpenAlexW2040551218MaRDI QIDQ4032588

Julien Bramel, David Simchi-Levi, Edward G. jun. Coffman, Peter W. Shor

Publication date: 1 April 1993

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.40.6.1095

zbMATH Keywords

probabilistic analysiscapacitated vehicle routingpolynomial-time heuristicsunsplit demands

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

On properties of geometric random problems in the plane ⋮ Routing problems: A bibliography ⋮ Challenges and Advances in A Priori Routing ⋮ Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines ⋮ Approximate algorithms with estimates for routing problems on random inputs with a bounded number of customers per route