Pages that link to "Item:Q673814"
From MaRDI portal
The following pages link to A note on the complexity of local search problems (Q673814):
Displaying 14 items.
- Nested PLS (Q535153) (← links)
- Local search, reducibility and approximability of NP-optimization problems (Q673464) (← links)
- Analyzing the complexity of finding good neighborhood functions for local search algorithms (Q857808) (← links)
- Complexity of local search for the \(p\)-median problem (Q932191) (← links)
- How easy is local search? (Q1109573) (← links)
- Local search and the local structure of NP-complete problems (Q1200797) (← links)
- Finding optimal subgraphs by local search (Q1392027) (← links)
- The complexity of Boolean constraint satisfaction local search problems (Q1777392) (← links)
- On the query complexity of finding a local maximum point. (Q1853165) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- On the \(\mathcal {PLS}\)-complexity of maximum constraint assignment (Q1935800) (← links)
- Simple Local Search Problems that are Hard to Solve (Q3204045) (← links)
- The analysis of local search problems and their heuristics (Q3975934) (← links)
- The communication complexity of local search (Q5212806) (← links)