Ordered spatial sampling by means of the traveling salesman problem
DOI10.1007/S00180-015-0635-1zbMATH Open1348.65021OpenAlexW2310185454MaRDI QIDQ333365FDOQ333365
Authors: Maria Michela Dickson, Yves Tille 
Publication date: 28 October 2016
Published in: Computational Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00180-015-0635-1
Recommendations
- Ordering properties of spacings from heterogeneous geometric samples
- Optimal TSP tour length estimation using Sammon maps
- Euclidean Traveling Salesman Tours through Stochastic Neighborhoods
- Spatial sampling design based on stochastic complexity.
- Optimal dynamic spatial sampling
- Sampling of closely-spaced ordered set of uniformly distributed random variables
- Random tours in the traveling salesman problem: Analysis and application
Computational methods for problems pertaining to statistics (62-08) Sampling theory, sample surveys (62D05) Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)
Cites Work
- Spatially balanced sampling through the pivotal method
- Spatially correlated Poisson sampling
- A Generalization of Sampling Without Replacement From a Finite Universe
- Efficient balanced sampling: The cube method
- A fast algorithm for balanced sampling
- Sampling with unequal probabilities
- Unequal probability sampling without replacement through a splitting method
- Spatially Balanced Sampling of Natural Resources
- An Automatic Method of Solving Discrete Programming Problems
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- Solution of a Large-Scale Traveling-Salesman Problem
- A Method for Solving Traveling-Salesman Problems
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- Title not available (Why is that?)
- The Euclidean traveling salesman problem is NP-complete
- Some Simple Applications of the Travelling Salesman Problem
- Symmetric traveling salesman problems
- A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
- Title not available (Why is that?)
- Computer Solutions of the Traveling Salesman Problem
- Title not available (Why is that?)
- On a characterization of ordered pivotal sampling
- Sampling algorithms.
- Penalized balanced sampling
- On the Theory of Systematic Sampling, II
- Doubly balanced spatial sampling with spreading and restitution of auxiliary totals
- Solution of large-scale symmetric travelling salesman problems
Cited In (7)
- One point per cluster spatially balanced sampling
- Spatial spread sampling using weakly associated vectors
- Spatially balanced sampling with local ranking
- Some Solutions Inspired by Survey Sampling Theory to Build Effective Clinical Trials
- Alternative and complementary approaches to spatially balanced samples
- Spatially Balanced Sampling: A Review and A Reappraisal
- Sequential adaptive strategies for sampling rare clustered populations
Uses Software
This page was built for publication: Ordered spatial sampling by means of the traveling salesman problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q333365)
