Theoretical aspects of local search.

DOI10.1007/978-3-540-35854-1zbMath1130.90061OpenAlexW1539964999MaRDI QIDQ859710

Wil Michiels, Jan H. M. Korst, Emile H. L. Aarts

Publication date: 18 January 2007

Published in: Monographs in Theoretical Computer Science. An EATCS Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-35854-1

zbMATH Keywords

complexitymachine schedulingapproximation algorithmtravelling salesman problemLocal search

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Search theory (90B40) Deterministic scheduling theory in operations research (90B35) 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)

Related Items (21)

Exponential size neighborhoods for makespan minimization scheduling ⋮ Alternative evaluation functions for the cyclic bandwidth sum problem ⋮ A hybrid iterated local search algorithm with adaptive perturbation mechanism by success-history based parameter adaptation for differential evolution (SHADE) ⋮ Smoothed performance guarantees for local search ⋮ Heuristic and exact algorithms for a min-max selective vehicle routing problem ⋮ On benefits and drawbacks of aging strategies for randomized search heuristics ⋮ Local search: is brute-force avoidable? ⋮ Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees ⋮ Local search for Boolean satisfiability with configuration checking and subscore ⋮ Minimizing Rosenthal potential in multicast games ⋮ Performance analysis of the \((1+1)\) evolutionary algorithm for the multiprocessor scheduling problem ⋮ Unrelated parallel machine scheduling -- perspectives and progress ⋮ Computational aspects of the colorful Carathéodory theorem ⋮ Local search inequalities ⋮ Short sequences of improvement moves lead to approximate equilibria in constraint satisfaction games ⋮ A hybrid genetic algorithm for the single machine maximum lateness problem with release times and family setups ⋮ On the parameterized complexity of consensus clustering ⋮ Nonoblivious 2-Opt heuristics for the traveling salesman problem ⋮ The impact of parametrization in memetic evolutionary algorithms ⋮ On the effectiveness of immune inspired mutation operators in some discrete optimization problems ⋮ Performance guarantees of local search for minsum scheduling problems

This page was built for publication: Theoretical aspects of local search.