A note on the complexity of local search problems
type: Item
instance of: scholarly article
title: A note on the complexity of local search problems
zbMATH Open document ID: 0875.68312
DOI: 10.1016/0020-0190(94)00184-Z
published in: Information Processing Letters
publication date: 1997-02-28T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68R05
zbMATH DE Number: 985782
zbMATH Keywords: Combinatorial problems
zbMATH Keywords: Theory of computation
zbMATH Keywords: Local search
author: Sophie Fischer
MaRDI profile type: Publication
cites work: Q4198056
cites work: How easy is local search?
cites work: On Finding and Verifying Locally Optimal Solutions
cites work: The Complexity of the Lin–Kernighan Heuristic for the Traveling Salesman Problem
cites work: Simple Local Search Problems that are Hard to Solve
full work available at URL: 0020-0190(94)00184-z
OpenAlex ID: W2093399001
Wikidata QID: Q127353019
description: scientific article; zbMATH DE number 985782