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