Confidence in heuristic solutions?
type: Item
instance of: scholarly article
title: Confidence in heuristic solutions?
zbMATH Open document ID: 1332.90221
author: Kenneth Carling
author: Xiangli Meng
published in: Journal of Global Optimization
publication date: 2015-10-20T00:00:00Z
full work available at URL: http://urn.kb.se/resolve
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6496856
zbMATH Keywords: \(p\)-median problem
zbMATH Keywords: deterministic bounds
zbMATH Keywords: statistical bounds
zbMATH Keywords: jackknife
zbMATH Keywords: discrete optimization
zbMATH Keywords: extreme value theory
describes a project that uses: OR-Library
describes a project that uses: SITATION
describes a project that uses: MOD-DIST
describes a project that uses: MENU-OKF
MaRDI profile type: Publication
OpenAlex ID: W1978174774
cites work: Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem
cites work: Q5192199
cites work: Lagrangean heuristics for location problems
cites work: Q4229618
cites work: Does Euclidean distance work well when the \(p\)-median model is applied in rural areas?
cites work: On statistical bounds of heuristic solutions to location problems
cites work: Robust Locally Weighted Regression and Smoothing Scatterplots
cites work: Procedures for Estimating Optimal Solution Values for Large Combinatorial Problems
cites work: Q4857376
cites work: Using Confidence Limits for the Global Optimum in Combinatorial Optimization
cites work: Bootstrap methods: another look at the jackknife
cites work: Interval estimation of a global optimum for large combinatorial problems
cites work: Heuristic solutions and confidence intervals for the multicovering problem
cites work: Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
cites work: Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
cites work: An Algorithmic Approach to Network Location Problems. II: Thep-Medians
cites work: Q3316922
cites work: Algorithms of ant system and simulated annealing for the \(p\)-median problem
cites work: Region-rejection based heuristics for the capacitated multi-source Weber problem
cites work: A Search Model for Evaluating Combinatorially Explosive Problems
cites work: Confidence Limits for Global Optima Based on Heuristic Solutions to Difficult Optimization Problems: A Simulation Study
cites work: A computational evaluation of optimal solution value estimation procedures
cites work: NOTES ON BIAS IN ESTIMATION
cites work: Solution methods for thep-median problem: An annotated bibliography
cites work: Estimation of a truncation point
cites work: Comparison of iterative searches for the quadratic assignment problem
cites work: Definition and Comparison of Robust Nonlinear Data Smoothing Algorithms
cites work: Case study on statistically estimating minimum makespan for flow line scheduling problems.
DOI: 10.1007/S10898-015-0293-4
Recommended article: Q5337291
Recommended article: Q3783435
Recommended article: Q4231144
Recommended article: An overview of heuristic solution methods
Recommended article: High Confidence Heuristic Strategy for Minimal Reduction
Recommended article: Q3720323
Recommended article: On the Discovery and Generation of Certain Heuristics
description: scientific article; zbMATH DE number 6496856