Theoretical aspects of local search.
DOI10.1007/978-3-540-35854-1zbMATH Open1130.90061OpenAlexW1539964999MaRDI QIDQ859710FDOQ859710
Authors: W. Michiels, E. Aarts, J. Korst 
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
Recommendations
- scientific article; zbMATH DE number 1082099
- Local search algorithms for combinatorial problems. Analysis, improvements, and new applications (Thesis TU Darmstadt 1998)
- Stochastic local search. Foundations and applications.
- Local search heuristics for combinatorial optimization problems
- Local Search Based on Genetic Algorithms
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Search theory (90B40) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Abstract computational complexity for mathematical programming problems (90C60)
Cited In (30)
- Smoothed performance guarantees for local search
- A Survey of Approximation Results for Local Search Algorithms
- A framework for analyzing sub-optimal performance of local search algorithms
- Local Search Based on Genetic Algorithms
- Performance guarantees of local search for minsum scheduling problems
- Alternative evaluation functions for the cyclic bandwidth sum problem
- Local search inequalities
- Mechanisms for local search
- Local search and the local structure of NP-complete problems
- Title not available (Why is that?)
- On the parameterized complexity of consensus clustering
- 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 for Boolean satisfiability with configuration checking and subscore
- Experimental and theoretical analysis of local search optimising OBDD variable orderings
- Exponential size neighborhoods for makespan minimization scheduling
- Local search algorithms for combinatorial problems. Analysis, improvements, and new applications (Thesis TU Darmstadt 1998)
- Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees
- Computational aspects of the colorful Carathéodory theorem
- Minimizing Rosenthal potential in multicast games
- Performance analysis of the \((1+1)\) evolutionary algorithm for the multiprocessor scheduling problem
- On the effectiveness of immune inspired mutation operators in some discrete optimization problems
- The impact of parametrization in memetic evolutionary algorithms
- A hybrid iterated local search algorithm with adaptive perturbation mechanism by success-history based parameter adaptation for differential evolution (SHADE)
- Unrelated parallel machine scheduling -- perspectives and progress
- Nonoblivious 2-opt heuristics for the traveling salesman problem
- A hybrid genetic algorithm for the single machine maximum lateness problem with release times and family setups
- Local search: is brute-force avoidable?
- Title not available (Why is that?)
- Traveling salesman problem and local search
This page was built for publication: Theoretical aspects of local search.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q859710)
