Probabilistic analysis of a capactiated vehicle routing problem—I

References

• Bramel J. Coffman E. Shor P. Simchi-Levi D. Probabilistic analysis of the capacitated vehicle routing problem with unsplit demands Operations Research 1991 to appear in
   Google Scholar
• Haimovich , M. and Rinnooy Kan , A.H.G. 1985 . Bounds and heuristics for capacitated routing problems . Mathematics of Operations Research , 10 : 527 – 542 .
   Web of Science ®Google Scholar
• Haimovich , M. , Rinnooy Kan , A.H.G. and Stougie , L. 1988 . “ Analysis of heuristics for vehicle routing problems ” . In Vehicle Routing: Methods and Studies , Edited by: Golden , B.L. and Assad , A.A. 47 – 61 . Elsevier Science Publishers . B.V
   Google Scholar
• Rhee , W.T. 1988 . Optimal bin packing with items of random sizes . Mathematics of Operations Research , 13 : 140 – 151 .
   Web of Science ®Google Scholar
• Rhee , W.T. 1990 . A note on optimal bin packing and optimal bin covering with items of random sizes . SIAM J. Computing , 19 : 705 – 710 .
   Web of Science ®Google Scholar
• Rhee , W.T. and Talagrand , M. 1987 . Martingale inequalities and NP-complete problems . Mathematics of Operations Research , 12 : 177 – 181 .
   Web of Science ®Google Scholar
• Rhee , W.T. and Talagrand , M. 1989 . Optimal bin packing with items of random size II . SlAM J. Computing , 18 : 139 – 151 .
   Google Scholar
• Rhee , W.T. and Talagrand , M. 1989 . Optimal bin packing with items of random size III . SIAM J. Computing , 18 : 473 – 486 .
   Web of Science ®Google Scholar
• Rhee W.T. Talagrand M. Matching random subsets of the cube with a tight control on one coordinate The Annals of Applied Probability 1991 to appear in
   Google Scholar
• Simchi-Levi D. Bramel J. on the Optimal Solutions of the Capacitated Vehicle Routing Problem 1990 preprint
   Google Scholar