Using Confidence Limits for the Global Optimum in Combinatorial Optimization
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3850824
- Confidence Limits for Global Optima Based on Heuristic Solutions to Difficult Optimization Problems: A Simulation Study
- Confidence in heuristic solutions?
- Integrating interval estimates of global optima and local search methods for combinatorial optimization problems
- Statistical analysis of local search landscapes
Cited in
(13)- Confidence Limits for Global Optima Based on Heuristic Solutions to Difficult Optimization Problems: A Simulation Study
- Integrating interval estimates of global optima and local search methods for combinatorial optimization problems
- On statistical bounds of heuristic solutions to location problems
- Best practices for comparing optimization algorithms
- Fast, efficient and accurate solutions to the Hamiltonian path problem using neural approaches
- Case study on statistically estimating minimum makespan for flow line scheduling problems.
- A theoretical minimal solution for heuristics: the case of the spatial harvest timber problem
- Parallel genetic algorithms with local search
- Confidence in heuristic solutions?
- Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem
- Using a hybrid of exact and genetic algorithms to design survivable networks
- Heuristic solutions and confidence intervals for the multicovering problem
- scientific article; zbMATH DE number 3850824 (Why is no real title available?)
This page was built for publication: Using Confidence Limits for the Global Optimum in Combinatorial Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3714898)
