A Search Model for Evaluating Combinatorially Explosive Problems

DOI10.1287/OPRE.19.6.1331MaRDI QIDQ5636679zbMATH OpenOpenAlexFDO

Authors Keith L. McRoberts

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

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Search theory (90B40) Combinatorial optimization (90C27)

Cited in

(10)

• Randomized algorithms in combinatorial optimization: A survey
• A computational evaluation of optimal solution value estimation procedures
• Packing problems
• Tactical design of rail freight networks. II: Local search methods with statistical analysis
• 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
• On statistical bounds of heuristic solutions to location problems
• On the Weibull cost estimation of building frames designed by simulated annealing
• Confidence in heuristic solutions?
• Landscape-level optimization using tabu search and stand density-related forest management prescriptions

This page was built for publication: A Search Model for Evaluating Combinatorially Explosive Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5636679)