A Lower Bound for the Expected Travel Among m Random Points
From MaRDI portal
A Lower Bound for the Expected Travel Among $m$ Random Points
Cited in
(7)- On the average length of Delaunay triangulations
- Continuous approximation models in freight distribution management
- On estimating the distribution of optimal traveling salesman tour lengths using heuristics
- The average performance analysis of a closest‐pair algorithm
- An upper bound for the average length of the euclidean minimum spanning tree
- Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics
- Proposed theoretical value for TSP constant
This page was built for publication: A Lower Bound for the Expected Travel Among $m$ Random Points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5788231)