Integrating interval estimates of global optima and local search methods for combinatorial optimization problems

DOI10.1023/A:1009669326107zbMath0972.68632OpenAlexW1544624898MaRDI QIDQ5944360

Reha Uzsoy, Irfan M. Ovacik, Srikanth Rajagopalan

Publication date: 19 November 2001

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1009669326107

zbMATH Keywords

single machineanalysis of algorithmsdeterministicsequencingheuristicprogrammingsuboptimal algorithms

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Computing methodologies and applications (68U99) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (2)

Case study on statistically estimating minimum makespan for flow line scheduling problems. ⋮ Scheduling jobs on a \(k\)-stage flexible flow-shop

This page was built for publication: Integrating interval estimates of global optima and local search methods for combinatorial optimization problems