Ordered spatial sampling by means of the traveling salesman problem
From MaRDI portal
Publication:333365
DOI10.1007/s00180-015-0635-1zbMath1348.65021MaRDI QIDQ333365
Yves Tillé, Maria Michela Dickson
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
62-08: Computational methods for problems pertaining to statistics
90C35: Programming involving graphs or networks
62D05: Sampling theory, sample surveys
90C27: Combinatorial optimization
Related Items
Spatially Balanced Sampling: A Review and A Reappraisal, Some Solutions Inspired by Survey Sampling Theory to Build Effective Clinical Trials, Sequential adaptive strategies for sampling rare clustered populations, Alternative and complementary approaches to spatially balanced samples, Spatially balanced sampling with local ranking, Spatial spread sampling using weakly associated vectors
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spatially Balanced Sampling through the Pivotal Method
- Spatially correlated Poisson sampling
- Symmetric traveling salesman problems
- Solution of large-scale symmetric travelling salesman problems
- A fast algorithm for balanced sampling
- Sampling with unequal probabilities
- The Euclidean traveling salesman problem is NP-complete
- On a characterization of ordered pivotal sampling
- Sampling algorithms.
- Penalized balanced sampling
- Efficient balanced sampling: The cube method
- An Automatic Method of Solving Discrete Programming Problems
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- Unequal probability sampling without replacement through a splitting method
- A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
- Some Simple Applications of the Travelling Salesman Problem
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- Solution of a Large-Scale Traveling-Salesman Problem
- A Method for Solving Traveling-Salesman Problems
- Spatially Balanced Sampling of Natural Resources
- Computer Solutions of the Traveling Salesman Problem
- On the Theory of Systematic Sampling, II
- A Generalization of Sampling Without Replacement From a Finite Universe
- Doubly balanced spatial sampling with spreading and restitution of auxiliary totals
