Approximate local search in combinatorial optimization
From MaRDI portal
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation algorithms (68W25) Integer programming (90C10) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)
Recommendations
Cited in
(17)- Structural analysis of local search heuristics in combinatorial optimization
- Combining the scalability of local search with the pruning techniques of systematic search
- Efficient local search for pseudo Boolean optimization
- Exploiting relaxation in local search for LABS
- Subthreshold-seeking local search
- An iterative local search approach applied to the optimal stratification problem
- Local search: complexity and approximation
- \({\varepsilon}\)-optimization schemes and \(L\)-bit precision: alternative perspectives in combinatorial optimization (extended abstract)
- scientific article; zbMATH DE number 3878680 (Why is no real title available?)
- Computational bounds for local search in combinatorial optimization
- Approximate Local Search in Combinatorial Optimization
- scientific article; zbMATH DE number 1865680 (Why is no real title available?)
- Approximating Minimization Diagrams and Generalized Proximity Search
- Redistricting optimization with recombination: a local search case study
- Convergence to approximate Nash equilibria in congestion games
- Local search, reducibility and approximability of NP-optimization problems
- -optimization schemes and L-bit precision: alternative perspectives for solving combinatorial optimization problems
This page was built for publication: Approximate local search in combinatorial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501313)
