On statistical bounds of heuristic solutions to location problems

DOI10.1007/s10878-015-9839-0zbMath1347.90069OpenAlexW2033445852MaRDI QIDQ281793

Kenneth Carling, Xiangli Meng

Publication date: 11 May 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: http://urn.kb.se/resolve?urn=urn:nbn:se:du-14135

zbMATH Keywords

simulated annealing\(p\)-median problemextreme value theorydiscrete optimizationjackknife

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (2)

A theoretical minimal solution for heuristics: the case of the spatial harvest timber problem ⋮ Confidence in heuristic solutions?

Uses Software

• OR-Library
• SITATION
• MOD-DIST
• MENU-OKF

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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.
• A statistical analysis of simulated annealing applied to the \(p\)-median problem
• 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
• NOTES ON BIAS IN ESTIMATION
• Solution methods for thep-median problem: An annotated bibliography
• Using Confidence Limits for the Global Optimum in Combinatorial Optimization
• Procedures for Estimating Optimal Solution Values for Large Combinatorial Problems
• Interval estimation of a global optimum for large combinatorial problems
• 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: On statistical bounds of heuristic solutions to location problems