A Survey of Approximation Results for Local Search Algorithms
From MaRDI portal
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)
Recommendations
Cited in
(10)- Performance guarantees of local search for minsum scheduling problems
- Nonoblivious 2-opt heuristics for the traveling salesman problem
- Exponential size neighborhoods for makespan minimization scheduling
- Smoothed performance guarantees for local search
- Approximate Local Search in Combinatorial Optimization
- Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees
- Uniform unweighted set cover: the power of non-oblivious local search
- Local search, reducibility and approximability of NP-optimization problems
- Application of possibilistic optimization to interval-valued fuzzy numbers: supplemental diet
- Analyzing the complexity of finding good neighborhood functions for local search algorithms
This page was built for publication: A Survey of Approximation Results for Local Search Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5450803)
