A note on the complexity of local search problems

DOI10.1016/0020-0190(94)00184-ZzbMath0875.68312OpenAlexW2093399001WikidataQ127353019 ScholiaQ127353019MaRDI QIDQ673814

Sophie Fischer

Publication date: 28 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(94)00184-z

zbMATH Keywords

Local searchCombinatorial problemsTheory of computation

Mathematics Subject Classification ID

Searching and sorting (68P10) Combinatorics in computer science (68R05)

Related Items (1)

Metaheuristics: A bibliography

Cites Work

• Unnamed Item
• How easy is local search?
• Simple Local Search Problems that are Hard to Solve
• On Finding and Verifying Locally Optimal Solutions
• The Complexity of the Lin–Kernighan Heuristic for the Traveling Salesman Problem

This page was built for publication: A note on the complexity of local search problems