New local search approximation techniques for maximum generalized satisfiability problems
type: Item
instance of: scholarly article
title: New local search approximation techniques for maximum generalized satisfiability problems
zbMATH Open document ID: 1022.68560
DOI: 10.1016/0020-0190(95)00196-4
author: Paola Alimonti
published in: Information Processing Letters
publication date: 1997-02-27T00:00:00Z
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 984447
zbMATH Keywords: computational complexity
zbMATH Keywords: design of algorithms
zbMATH Keywords: local search
zbMATH Keywords: approximation
zbMATH Keywords: maximum generalized satisfiability
MaRDI profile type: Publication
full work available at URL: 0020-0190(95)00196-4
OpenAlex ID: W2083642130
cites work: Toward a unified approach for the classification of NP-complete optimization problems
cites work: Local search, reducibility and approximability of NP-optimization problems
cites work: Q4138187
cites work: Q4198056
cites work: Algorithms for the maximum satisfiability problem
cites work: Approximation algorithms for combinatorial problems
cites work: How easy is local search?
cites work: On Syntactic versus Computational Views of Approximability
cites work: Non deterministic polynomial optimization problems and their approximations
cites work: Q4739657
cites work: Optimization, approximation, and complexity classes
Wikidata QID: Q127372884
description: scientific article; zbMATH DE number 984447