Procedures for Estimating Optimal Solution Values for Large Combinatorial Problems
From MaRDI portal
Publication:4156111
DOI10.1287/mnsc.23.12.1273zbMath0377.90051OpenAlexW2091638116MaRDI QIDQ4156111
Publication date: 1977
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.23.12.1273
Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35)
Related Items (20)
Randomized algorithms in combinatorial optimization: A survey ⋮ On statistical bounds of heuristic solutions to location problems ⋮ Makespan distribution of permutation flowshop schedules ⋮ Bin packing problems in one dimension: Heuristic solutions and confidence intervals ⋮ A theoretical minimal solution for heuristics: the case of the spatial harvest timber problem ⋮ Best practices for comparing optimization algorithms ⋮ Landscape-level optimization using tabu search and stand density-related forest management prescriptions ⋮ A computational evaluation of optimal solution value estimation procedures ⋮ On the Weibull cost estimation of building frames designed by simulated annealing ⋮ Heuristics and their design: A survey ⋮ Unnamed Item ⋮ Case study on statistically estimating minimum makespan for flow line scheduling problems. ⋮ Fast, efficient and accurate solutions to the Hamiltonian path problem using neural approaches ⋮ Experimental evaluation of simulated annealing algorithms for the time-cost trade-off problem ⋮ Heuristic solutions and confidence intervals for the multicovering problem ⋮ Uso del estadisticoD n de Kolmogorov-Smirnov en inferencia parametrica ⋮ Confidence in heuristic solutions? ⋮ Heuristics for permutation flow shop scheduling with batch setup times ⋮ Heuristic methods and applications: A categorized survey ⋮ On the quality of heuristic solutions to a 19\(\times 19\) quadratic assignment problem
This page was built for publication: Procedures for Estimating Optimal Solution Values for Large Combinatorial Problems
