Computational bounds for local search in combinatorial optimization
From MaRDI portal
Recommendations
Cited in
(16)- Condition number based complexity estimate for computing local extrema
- Structural analysis of local search heuristics in combinatorial optimization
- Comparison of models of planning public-private partnership
- On the complexity of the local search in the p-median problem
- Bounds-Consistent Local Search
- Hardness of continuous local search: query complexity and cryptographic lower bounds
- Approximate Local Search in Combinatorial Optimization
- Low order polynomial bounds on the expected performance of local improvement algorithms
- scientific article; zbMATH DE number 2087632 (Why is no real title available?)
- On solving travelling salesman problem with vertex requisitions
- Hardness of continuous local search: query complexity and cryptographic lower bounds
- Approximate solution of the \(p\)-median minimization problem
- The communication complexity of local search
- Approximate local search in combinatorial optimization
- Local search, reducibility and approximability of NP-optimization problems
- Classification of applied methods of combinatorial optimization
This page was built for publication: Computational bounds for local search in combinatorial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3545176)
