On properties of geometric random problems in the plane

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.

[1]  Patrick Jaillet.  Analysis of Probabilistic Combinatorial Optimization Problems in Euclidean Spaces , 1993, Math. Oper. Res..

[2]  K. Alexander.  Rates of Convergence of Means for Distance-Minimizing Subadditive Euclidean Functionals , 1994 .

[3]  Patrick Jaillet,et al.  Cube versus Torus Models for Combinatorial Optimization Problems and the Euclidean Minimum Spanning Tree Constant , 1990 .

[4]  B. Weide.  Statistical methods in algorithm design and analysis. , 1978 .

[5]  Patrick Jaillet.  CUBE VERSUS TORUS MODELS AND THE EUCLIDEAN MINIMUM SPANNING TREE CONSTANT , 1993 .

[6]  J. Michael Steele,et al.  Worst-case greedy matchings in the unit d-cube , 1990, Networks.

[7]  J. Michael Steele,et al.  Complete Convergence of Short Paths and Karp's Algorithm for the TSP , 1981, Math. Oper. Res..

[8]  Patrick Jaillet.  Rate of convergence for the Euclidean minimum spanning tree limit law , 1993, Oper. Res. Lett..

[9]  David Simchi-Levi,et al.  Probabilistic Analysis of the Capacitated Vehicle Routing Problem with Unsplit Demands , 1992, Oper. Res..

[10]  John J. Bartholdi,et al.  Spacefilling curves and the planar travelling salesman problem , 1989, JACM.

[11]  D. Bertsimas,et al.  The Minimum Spanning Tree Constant in Geometrical Probability and Under the Independent Model: A Unified Approach , 1992 .

[12]  J. Beardwood,et al.  The shortest path through many points , 1959, Mathematical Proceedings of the Cambridge Philosophical Society.

[13]  Alexander H. G. Rinnooy Kan,et al.  Bounds and Heuristics for Capacitated Routing Problems , 1985, Math. Oper. Res..

[14]  Leen Stougie,et al.  ANALYSIS OF HEURISTICS FOR VEHICLE ROUTING PROBLEMS , 1988 .

[15]  J. Yukich,et al.  Limit Theorems and Rates of Convergence for Euclidean Functionals , 1994 .

[16]  J. Michael Steele,et al.  Boundary domination and the distribution of the largest nearest-neighbor link in higher dimensions , 1986, Journal of Applied Probability.

[17]  Wansoo T. Rhee.  On the Fluctuations of the Stochastic Traveling Salesperson Problem , 1991, Math. Oper. Res..

[18]  J. Steele.  Subadditive Euclidean Functionals and Nonlinear Growth in Geometric Probability , 1981 .

[19]  J. Steele,et al.  On the number of leaves of a euclidean minimal spanning tree , 1987, Journal of Applied Probability.

[20]  Richard M. Karp,et al.  Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane , 1977, Math. Oper. Res..

[21]  J. Michael Steele,et al.  Worst-Case Growth Rates of Some Classical Problems of Combinatorial Optimization , 1989, SIAM J. Comput..

[22]  J. Steele.  Growth Rates of Euclidean Minimal Spanning Trees With Power Weighted Edges , 1988 .

[23]  Leen Stougie,et al.  ANALYSIS OF HEURISTICS FOR VEHICLE ROUTING PROBLEMS. VEHICLE ROUTING: METHODS AND STUDIES. STUDIES IN MANAGEMENT SCIENCE AND SYSTEMS - VOLUME 16 , 1988 .

[24]  Patrick Jaillet.  Rates of Convergence for Quasi-Additive Smooth Euclidean Functionals and Application to Combinatorial Optimization Problems , 1992, Math. Oper. Res..

[25]  F. Roberts.  Random minimal trees , 1968 .

[26]  Wansoo T. Rhee,et al.  A sharp deviation inequality for the stochastic traveling salesman problem , 1989 .

[27]  Routo Terada,et al.  A Fast Algorithm for the Euclidean Traveling Salesman Problem, Optimal with Probability One , 1982, SIAM J. Comput..

[28]  Richard C. Larson,et al.  Urban Operations Research , 1981 .

[29]  N. Biggs.  THE TRAVELING SALESMAN PROBLEM A Guided Tour of Combinatorial Optimization , 1986 .

[30]  H. R. Pitt.  Divergent Series , 1951, Nature.

[31]  Wansoo T. Rhee,et al.  Martingale Inequalities and NP-Complete Problems , 1987, Math. Oper. Res..

[32]  David Simchi-Levi,et al.  Probabilistic Analyses and Practical Algorithms for the Vehicle Routing Problem with Time Windows , 1996, Oper. Res..