Bounds and Approximations for the Transportation Problem of Linear Programming and Other Scalable Network Problems

References

• Barenblatt G. I.Scaling: Dimensional Analysis and Intermediate Asymptotics (1996) (Cambridge University Press, Cambridge, U.K.) Google Scholar
• Beardwood J., Halton J. H., Hammersley J. M. The shortest path through many points. Proc. Cambridge Philos. Soc. (1959) 55:299–327Crossref, Google Scholar
• Bramel J., Simchi-Levi D.The Logic of Logistics (1997) (Springer-Verlag, Heidelberg, Germany) Crossref, Google Scholar
• Bridgman P. W.Dimensional Analysis (1963) (Yale University Press, New Haven, CT) Google Scholar
• Buckingham E. On physically similar systems: Illustrations of the use of dimensional equations. Phys. Rev. (1914) 4:345–376Crossref, Google Scholar
• Daganzo C. F. The length of tours in zones of different shapes. Transportation Res. (1984a) 18B:135–146Crossref, Google Scholar
• Daganzo C. F. The distance traveled to visit N points with a maximum of C stops per vehicle: An analytic model and an application. Transportation Sci. (1984b) 18:331–350Link, Google Scholar
• Daganzo C. F.Logistics Systems Analysis (1991) (Springer-Verlag, Heidelberg, Germany) Google Scholar
• Daganzo C. F.Logistics Systems Analysis (1999) 3rd ed(Springer-Verlag, Heidelberg, Germany) Crossref, Google Scholar
• Daganzo C. F., Smilowitz K. R. Asymptotic approximations for the transportation LP and other scalable network problems. (2000) . Working paper UCB-ITS-WP-2000-2, Institute of Transportation Studies, University of California, Berkeley, CAGoogle Scholar
• Eilon S., Watson-Gandy C. D. T., Christofides N.Distribution Management: Mathematical Modelling and Practical Analysis (1971) (Hafner, New York) Google Scholar
• Haimovich M. A., Rinnooy-Kan A. H. G., Stougie L. Bounds and heuristics for capacitated routing problems. Math. Oper. Res. (1985) 10:527–542Link, Google Scholar
• Hille E., Phillips R. S.Functional Analysis and Semi-Groups (1957) (Waverly Press, Baltimore, MD) Google Scholar
• Johnson N. L., Kotz S.Distributions in Statistics: Continuous Multivariate Distributions (1972) (John Wiley and Sons, New York) Google Scholar
• Karp R. M. Probabilistic analysis of partitioning algorithms for the traveling salesman problem. Math. Oper. Res. (1977) 2:209–224Link, Google Scholar
• Newell G. F. Design of multiple vehicle delivery tours—III: Valuable goods. Transportation Res. (1986) 20B:377–390Crossref, Google Scholar
• Newell G. F., Daganzo C. F. Design of multiple vehicle delivery tours—I: A ring-radial network. Transportation Res. (1986a) 20B:345–364Crossref, Google Scholar
• Newell G. F., Daganzo C. F. Design of multiple vehicle delivery tours—II: Other metrics. Transportation Res. (1986b) 20B:365–376Crossref, Google Scholar
• Papadimitriou C. H. The probabilistic analysis of matching heuristics. Proc. 15th Allerton Conf. Comm. Control Comput. (1978) (University of Illinois, Urbana, IL) 363–378Google Scholar
• Smilowitz K. R. Design and operation of multi-mode, multi-service logistics systems. (2001) (University of California, Berkeley, CA) . Doctoral dissertationGoogle Scholar
• Smilowitz K. R., Daganzo C. F. Cost modeling and solution techniques for complex transportation systems. (2002) . Submitted to Transportation Sci.Google Scholar
• Steele J. M. Optimal triangulation of random samples in the plane. Ann. Probab. (1982) 10:548–553Crossref, Google Scholar
• Steele J. M. Growth rates of Euclidean minimal spanning trees with power weighted edges. Ann. Probab. (1988) 16:1767–1787Crossref, Google Scholar
• Steele J. M. Probability theory and combinatorial optimization. CBMS-NSF Regional Conf. Ser. Appl. Math. (1997) (SIAM, Philadelphia, PA) Crossref, Google Scholar
• Yukich J. E.Probability Theory of Classical Euclidean Optimization Problems, Lecture Notes in Mathematics (1998) 1675(Springer-Verlag, Berlin, Germany) Crossref, Google Scholar