Local search: complexity and approximation
From MaRDI portal
Recommendations
Cited in
(31)- Visiting near-optimal solutions using local search algorithms
- The query complexity of finding local minima in the lattice
- On local search in d.c. optimization problems
- Effectiveness of local search for geometric optimization
- A Survey of Approximation Results for Local Search Algorithms
- Subthreshold-seeking local search
- Local MST computation with short advice
- Efficiency of a local algorithm for solving the traveling salesman problem
- A Complexity Analysis of Local Search Algorithms in Global Optimization
- Analyzing the complexity of finding good neighborhood functions for local search algorithms
- Approximation of Boolean functions by local search
- scientific article; zbMATH DE number 1865680 (Why is no real title available?)
- Bounds-Consistent Local Search
- A local search template.
- Mechanisms for local search
- Efficiency of Local Search
- Local search heuristics for combinatorial optimization problems
- Local search algorithms for the \(k\)-cardinality tree problem.
- Local search over a generalized neighborhood for an optimization problem of pseudo-Boolean functions
- General local search methods
- Local optimization on graphs
- Approximate Local Search in Combinatorial Optimization
- The communication complexity of local search
- Why locating local optima is sometimes more complicated than locating global ones
- On the query complexity of finding a local maximum point.
- Multiple optima in local search
- Local search, reducibility and approximability of NP-optimization problems
- Approximate local search in combinatorial optimization
- Commonalities in local search
- scientific article; zbMATH DE number 2087632 (Why is no real title available?)
- Simple Local Search Problems that are Hard to Solve
This page was built for publication: Local search: complexity and approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3059322)
