Probabilistic analysis of a capactiated vehicle routing problem—I

DOI10.1080/02331939308843873zbMath0820.90038OpenAlexW2037410010MaRDI QIDQ3835656

WanSoo T. Rhee

Publication date: 20 April 1995

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939308843873

zbMATH Keywords

rate of convergencematchingbin packingasymptotic valuerandom demandprobabilistic analysis of algorithmrandomly distributed customer locations

Mathematics Subject Classification ID

Stochastic programming (90C15) Transportation, logistics and supply chain management (90B06) Queues and service in operations research (90B22)

Cites Work

• A Note on Optimal Bin Packing and Optimal Bin Covering with Items of Random Size
• Optimal Bin Packing with Items of Random Sizes III
• Bounds and Heuristics for Capacitated Routing Problems
• Optimal Bin Packing with Items of Random Sizes
• Martingale Inequalities and NP-Complete Problems

This page was built for publication: Probabilistic analysis of a capactiated vehicle routing problem—I