A Survey of Approximation Results for Local Search Algorithms

DOI10.1007/11671541_2zbMath1132.68685OpenAlexW1494455882MaRDI QIDQ5450803

Eric Angel

Publication date: 14 March 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11671541_2

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (6)

Exponential size neighborhoods for makespan minimization scheduling ⋮ Smoothed performance guarantees for local search ⋮ Uniform unweighted set cover: the power of non-oblivious local search ⋮ Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees ⋮ Nonoblivious 2-Opt heuristics for the traveling salesman problem ⋮ Performance guarantees of local search for minsum scheduling problems

Uses Software

• QAPLIB

This page was built for publication: A Survey of Approximation Results for Local Search Algorithms