Skip to main content
SpringerLink
Log in

On properties of geometric random problems in the plane

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

In this paper, we present results dealing with properties of well-known geometric random problems in the plane, together with their motivations. The paper specifically concentrates on the traveling salesman and minimum spanning tree problems, even though most of the results apply to other problems such as the Steiner tree problem and the minimum weight matching problem.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. K. Alexander, Rates of convergence of means for distance-minimizing subadditive Euclidean functionals, Department of Mathematics, University of Southern California, Los Angeles (1992), to appear in Annals of Applied Probability.

    Google Scholar 

  2. J. Avram and D. Bertsimas, The minimum spanning tree constant in geometrical probability and under the independent model; a unified approach, Annals of Applied Probability 2(1992)113–130.

    Google Scholar 

  3. J. Beardwood, J. Halton and J. Hammersley, The shortest path through many points, Proc. Camb. Phil. Soc. 55(1959)299–327.

    Google Scholar 

  4. J. Bramel and D. Simchi-Levi, Probabilistic analyses and practical algorithms for the vehicle routing problem with time windows, Working Paper, Department of IEOR, Columbia University (1992).

  5. J. Bramel, E. Coffman, P. Shor and D. Simchi-Levi, Probabilistic analysis of algorithms for the capacitated vehicle routing problem with time windows, Operations Research 40(1992)1095–1106.

    Google Scholar 

  6. G. Caplain and P. Jaillet, On the largest edge in a minimum spanning tree in the square, Working Note, Laboratoire de Mathématiques et Modélisation, Ecole Nationale des Ponts et Chaussées, Paris (1990).

    Google Scholar 

  7. E. Gilbert, Random minimal trees, Journal of SIAM 13(1965)376–387.

    Google Scholar 

  8. G. Hardy,Divergent Series (Clarendon Press, 1949).

  9. M. Haimovich and A. Rinnooy Kan, Bounds and heuristics for capacitated routing problems, Mathematics of Operations Research 10(1985)527–542.

    Google Scholar 

  10. M. Haimovich, A. Rinnooy Kan and L. Stougie, Analysis of heuristics for vehicle routing problems, in:Vehicle Routing: Methods and Studies, eds. B. Golden and A. Assad, Studies in Management Science and Systems 16 (North-Holland, Amsterdam 1988).

    Google Scholar 

  11. J. Halton and R. Terada, A fast algorithm for the Euclidean traveling salesman problem, optimal with probability one, SIAM Journal of Computing 11(1982)29–46.

    Article  Google Scholar 

  12. P. Jaillet, Probabilistic routing problems in the plane, in:Operational Research 90, ed. H. Bradley (Pergamon Press, London, 1991) pp. 675–688.

    Google Scholar 

  13. P. Jaillet, Rates of convergence for quasi-additive smooth Euclidean functionals and applications to combinatorial optimization problems, Mathematics of Operations Research 17(1992)965–980.

    Google Scholar 

  14. P. Jaillet, Analysis of probabilistic combinatorial optimization problems in Euclidean spaces, Mathematics of Operations Research 18(1993)51–71.

    Google Scholar 

  15. P. Jaillet, Cube versus torus models for combinatorial optimization problems and the Euclidean minimum spanning tree constant, Annals of Applied Probability 3(1993)582–592.

    Google Scholar 

  16. P. Jaillet, Rate of convergence for the Euclidean minimum spanning tree limit law, Operations Research Letters 14(1993)73–78.

    Article  MathSciNet  Google Scholar 

  17. D. Johnson, private communication, Bell Labs. (1993).

  18. R. Karp, Probabilistic analysis of partitioning algorithms for the traveling salesman problem in the plane, Mathematics of Operations Research 2(1985)209–224.

    Google Scholar 

  19. R. Karp and J. Steele, Probabilistic analysis of heuristics, in:The Traveling Salesman Problem, eds. E. Lawler, J. Lenstra, A. Rinnooy Kan and D. Shmoys (Wiley, Chichester, 1985).

    Google Scholar 

  20. C. Papadimitriou, The probabilistic analysis of matching heuristics,Proc. 15th Annual Conf. Comm. Contr. Comp. (1978) pp. 368–378.

  21. R. Larson and A. Odoni,Urban Operations Research (Prentice-Hall, NJ, 1981).

    Google Scholar 

  22. E. Lawler, J. Lenstra, A. Rinnooy Kan and D. Shmoys (eds.),The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization (Wiley, Chichester, 1985).

    Google Scholar 

  23. L. Platzman and J. Bartholdi III, Spacefilling curves and the planar travelling salesman problem, Journal of ACM 36(1989)719–737.

    Article  Google Scholar 

  24. C. Redmond and J. Yukich, Limit theorems and rates of convergence for Euclidean functionals, Department of Mathematics, University of Amherst, MA (1993).

    Google Scholar 

  25. W. Rhee, On the fluctuations of the stochastic traveling salesperson problem, Mathematics of Operations Research 16(1991)482–489.

    Google Scholar 

  26. W. Rhee, Boundary effects in the travelling salesperson problem, Department of Management Science, The Ohio State University, Columbus (1992), to appear in Operations Research Letters.

  27. W. Rhee, Department of Management Science, The Ohio State University, Columbus (1992).

    Google Scholar 

  28. W. Rhee and M. Talagrand, Martingale inequalities and NP-complete problems, Mathematics of Operations Research 12(1987)177–181.

    Google Scholar 

  29. W. Rhee and M. Talagrand, A sharp deviation inequality for the stochastic traveling salesman problem, Annals of Probability 17(1988)1–8.

    Google Scholar 

  30. R. Schmidt, Uber das Borelsche Summierungsverfahren, Schriften d. Königsberger gel. Gesellschaft 1(1925)205–256.

    Google Scholar 

  31. J. Steele, Subadditive Euclidean functionals and nonlinear growth in geometric probability, Annals of Probability 9(1981)365–376.

    Google Scholar 

  32. J. Steele, Complete convergence of short paths and Karp's algorithm for the TSP, Mathematics of Operations Research 6(1981)374–378.

    Google Scholar 

  33. J. Steele, Growth rates of Euclidean minimal spanning trees with power weighted edges, Annals of Probability 16(1988)1767–1787.

    Google Scholar 

  34. J. Steele and L. Snyder, Worst-case greedy matchings in the unitd-cube, SIAM Journal of Computing 18(198)278–287.

  35. J. Steele and L. Tierney, Boundary domination and the distribution of the largest nearest-neighbor link in higher dimensions, Journal of Applied Probability 23(1986)524≤–528.

    Google Scholar 

  36. J. Steele, L. Shepp and W. Eddy, On the number of leaves of a Euclidean minimal spanning tree, Journal of Applied Probability 24(1986)809–826.

    Google Scholar 

  37. B. Weide, Statistical methods in algorithm design and analysis, Ph.D. Dissertation, Computer Science Department, Carnegie-Mellon University (1978).

Download references

Author information

Authors and Affiliations

  1. MSIS Department, The University of Texas at Austin, 78712-1175, Austin, TX, USA

    Patrick Jaillet

  2. Laboratoire de Mathématiques Appliquées, ENPC, France

    Patrick Jaillet

Authors
  1. Patrick Jaillet
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jaillet, P. On properties of geometric random problems in the plane. Ann Oper Res 61, 1–20 (1995). https://doi.org/10.1007/BF02098279

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02098279

Keywords

Search

Navigation