On Finding and Verifying Locally Optimal Solutions
From MaRDI portal
Publication:3474886
Recommendations
Cited in
(10)- Finding optimal subgraphs by local search
- Finding robust solutions using local search
- How easy is local search?
- The complexity of Boolean constraint satisfaction local search problems
- Local minima for indefinite quadratic knapsack problems
- Linearizing genomes: exact methods and local search
- Local optimization of dynamic programs with guaranteed satisfaction of path constraints
- Improving TSP tours using dynamic programming over tree decompositions
- The malleability of TSP 2Opt
- A note on the complexity of local search problems
This page was built for publication: On Finding and Verifying Locally Optimal Solutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3474886)