Confidence in heuristic solutions?
From MaRDI portal
Publication:746822
DOI10.1007/s10898-015-0293-4zbMath1332.90221OpenAlexW1978174774MaRDI QIDQ746822
Publication date: 20 October 2015
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: http://urn.kb.se/resolve?urn=urn:nbn:se:du-14457
\(p\)-median problemextreme value theorydiscrete optimizationjackknifedeterministic boundsstatistical bounds
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On statistical bounds of heuristic solutions to location problems
- Heuristic solutions and confidence intervals for the multicovering problem
- Region-rejection based heuristics for the capacitated multi-source Weber problem
- A computational evaluation of optimal solution value estimation procedures
- Bootstrap methods: another look at the jackknife
- Case study on statistically estimating minimum makespan for flow line scheduling problems.
- Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem
- Lagrangean heuristics for location problems
- Does Euclidean distance work well when the \(p\)-median model is applied in rural areas?
- Algorithms of ant system and simulated annealing for the \(p\)-median problem
- Confidence Limits for Global Optima Based on Heuristic Solutions to Difficult Optimization Problems: A Simulation Study
- NOTES ON BIAS IN ESTIMATION
- Solution methods for thep-median problem: An annotated bibliography
- Using Confidence Limits for the Global Optimum in Combinatorial Optimization
- Robust Locally Weighted Regression and Smoothing Scatterplots
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- Definition and Comparison of Robust Nonlinear Data Smoothing Algorithms
- Procedures for Estimating Optimal Solution Values for Large Combinatorial Problems
- Interval estimation of a global optimum for large combinatorial problems
- Comparison of iterative searches for the quadratic assignment problem
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- Estimation of a truncation point
- A Search Model for Evaluating Combinatorially Explosive Problems
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
This page was built for publication: Confidence in heuristic solutions?
