Ordered spatial sampling by means of the traveling salesman problem
From MaRDI portal
Publication:333365
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
Cites work
- scientific article; zbMATH DE number 2064404 (Why is no real title available?)
- scientific article; zbMATH DE number 1500530 (Why is no real title available?)
- scientific article; zbMATH DE number 3895002 (Why is no real title available?)
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- A Generalization of Sampling Without Replacement From a Finite Universe
- A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
- A fast algorithm for balanced sampling
- A method for solving traveling-salesman problems
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- An Automatic Method of Solving Discrete Programming Problems
- Computer Solutions of the Traveling Salesman Problem
- Doubly balanced spatial sampling with spreading and restitution of auxiliary totals
- Efficient balanced sampling: The cube method
- On a characterization of ordered pivotal sampling
- On the Theory of Systematic Sampling, II
- Penalized balanced sampling
- Sampling algorithms.
- Sampling with unequal probabilities
- Solution of a Large-Scale Traveling-Salesman Problem
- Solution of large-scale symmetric travelling salesman problems
- Some Simple Applications of the Travelling Salesman Problem
- Spatially Balanced Sampling of Natural Resources
- Spatially balanced sampling through the pivotal method
- Spatially correlated Poisson sampling
- Symmetric traveling salesman problems
- The Euclidean traveling salesman problem is NP-complete
- Unequal probability sampling without replacement through a splitting method
Cited in
(7)- One point per cluster spatially balanced sampling
- Some Solutions Inspired by Survey Sampling Theory to Build Effective Clinical Trials
- Spatial spread sampling using weakly associated vectors
- Alternative and complementary approaches to spatially balanced samples
- Spatially Balanced Sampling: A Review and A Reappraisal
- Spatially balanced sampling with local ranking
- Sequential adaptive strategies for sampling rare clustered populations
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)