Procedures for Estimating Optimal Solution Values for Large Combinatorial Problems
From MaRDI portal
Cited in
(20)- Randomized algorithms in combinatorial optimization: A survey
- Bin packing problems in one dimension: Heuristic solutions and confidence intervals
- A computational evaluation of optimal solution value estimation procedures
- Heuristics and their design: A survey
- Case study on statistically estimating minimum makespan for flow line scheduling problems.
- Best practices for comparing optimization algorithms
- Heuristics for permutation flow shop scheduling with batch setup times
- Heuristic methods and applications: A categorized survey
- Fast, efficient and accurate solutions to the Hamiltonian path problem using neural approaches
- A theoretical minimal solution for heuristics: the case of the spatial harvest timber problem
- On statistical bounds of heuristic solutions to location problems
- Uso del estadisticoD n de Kolmogorov-Smirnov en inferencia parametrica
- scientific article; zbMATH DE number 1208126 (Why is no real title available?)
- Heuristic solutions and confidence intervals for the multicovering problem
- On the Weibull cost estimation of building frames designed by simulated annealing
- Experimental evaluation of simulated annealing algorithms for the time-cost trade-off problem
- Confidence in heuristic solutions?
- On the quality of heuristic solutions to a 19\(\times 19\) quadratic assignment problem
- Makespan distribution of permutation flowshop schedules
- Landscape-level optimization using tabu search and stand density-related forest management prescriptions
This page was built for publication: Procedures for Estimating Optimal Solution Values for Large Combinatorial Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4156111)
