A Search Model for Evaluating Combinatorially Explosive Problems
From MaRDI portal
Publication:5636679
DOI10.1287/opre.19.6.1331zbMath0228.90021OpenAlexW2027438174MaRDI QIDQ5636679
Publication date: 1971
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.19.6.1331
Search theory (90B40) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
Related Items
Randomized algorithms in combinatorial optimization: A survey ⋮ On statistical bounds of heuristic solutions to location problems ⋮ A theoretical minimal solution for heuristics: the case of the spatial harvest timber problem ⋮ 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 ⋮ Case study on statistically estimating minimum makespan for flow line scheduling problems. ⋮ Packing problems ⋮ Confidence in heuristic solutions? ⋮ Tactical design of rail freight networks. II: Local search methods with statistical analysis
