Journal ArticleDOI
The shortest path through many points
Jillian Beardwood,John H. Halton,J. M. Hammersley +2 more
- Vol. 55, Iss: 4, pp 299-327
Reads0
Chats0
TLDR
In this paper, it was shown that the length of the shortest closed path through n points in a bounded plane region of area v is almost always asymptotically proportional to √(nv) for large n; and this result was extended to bounded Lebesgue sets in k-dimensional Euclidean space.Abstract:
We prove that the length of the shortest closed path through n points in a bounded plane region of area v is ‘almost always’ asymptotically proportional to √(nv) for large n; and we extend this result to bounded Lebesgue sets in k–dimensional Euclidean space. The constants of proportionality depend only upon the dimensionality of the space, and are independent of the shape of the region. We give numerical bounds for these constants for various values of k; and we estimate the constant in the particular case k = 2. The results are relevant to the travelling-salesman problem, Steiner's street network problem, and the Loberman—Weinberger wiring problem. They have possible generalizations in the direction of Plateau's problem and Douglas' problem.read more
Citations
More filters
Dissertation
Random graph processes and optimisation
TL;DR: This thesis uses a random graph process to analyse a particular load balancing algorithm from theoretical computer science and demonstrates that random graph processes may also be used to analyse other algorithms and systems of a random nature, from areas such as computer science, telecommunications and other areas of engineering and mathematics.
Journal ArticleDOI
Balanced dynamic multiple travelling salesmen: Algorithms and continuous approximations
TL;DR: Two heuristics are proposed that solve the balanced dynamic multiple travelling salesmen problem (BD-mTSP) and represent operational (tactical) tools for dynamic (online, real-time) routing.
Journal ArticleDOI
Bike-sharing inventory management for market expansion
TL;DR: In this paper , a multi-stage max-min-max robust maximization model is proposed to optimize the dynamic bike inventory to maximize the worst-case revenue that the competitor firm may achieve.
Journal ArticleDOI
Equidistribution in All Dimensions of Worst-Case Point Sets forthe Traveling Salesman Problem
TL;DR: Equidistribution theorems are the first results concerning the structure of worst-case point sets like S(n), where the number of points in S^{(n)}\cap R$ is asymptotic to $n$ times the volume of $R$.
Posted Content
Feature Selection for multi-labeled variables via Dependency Maximization
TL;DR: This work proposes a new criterion for feature selection that is formulated as conditional information between features given the labeled variable, using the standard mutual information measure based on Kullback-Leibler divergence to filter out redundant features for the purpose of multiclass classification.
References
More filters
Journal ArticleDOI
On the shortest spanning subtree of a graph and the traveling salesman problem
TL;DR: Kurosh and Levitzki as discussed by the authors, on the radical of a general ring and three problems concerning nil rings, Bull Amer Math Soc vol 49 (1943) pp 913-919 10 -, On the structure of algebraic algebras and related rings.
Book ChapterDOI
Solution of a Large-Scale Traveling-Salesman Problem
TL;DR: The RAND Corporation in the early 1950s contained Arrow, Bellman, Dantzig, Flood, Ford, Fulkerson, Gale, Johnson, Nash, Orchard-Hays, Robinson, Shapley, Simon, Wagner, and other household names as discussed by the authors.
Journal ArticleDOI