Cube versus Torus Models for Combinatorial Optimization Problems and the Euclidean Minimum Spanning Tree Constant
暂无分享,去创建一个
[1] J. Beardwood,et al. The shortest path through many points , 1959, Mathematical Proceedings of the Cambridge Philosophical Society.
[2] Richard M. Karp,et al. Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane , 1977, Math. Oper. Res..
[3] J. Steele. Subadditive Euclidean Functionals and Nonlinear Growth in Geometric Probability , 1981 .
[4] J. Michael Steele,et al. Boundary domination and the distribution of the largest nearest-neighbor link in higher dimensions , 1986, Journal of Applied Probability.
[5] J. Steele. Growth Rates of Euclidean Minimal Spanning Trees With Power Weighted Edges , 1988 .
[6] Wansoo T. Rhee. On the Fluctuations of the Stochastic Traveling Salesperson Problem , 1991, Math. Oper. Res..
[7] Patrick Jaillet. Rates of Convergence for Quasi-Additive Smooth Euclidean Functionals and Application to Combinatorial Optimization Problems , 1992, Math. Oper. Res..