New local search approximation techniques for maximum generalized satisfiability problems

Publisher Website

1 January 1994

book chapter
Published by Springer Nature

p. 40-53
https://doi.org/10.1007/3-540-57811-0_5

Abstract

No abstract available

Keywords

This publication has 7 references indexed in Scilit:

Approximation algorithms for combinatorial problems
Published by Elsevier ,2007
Algorithms for the maximum satisfiability problem
Computing, 1990
How easy is local search?
Journal of Computer and System Sciences, 1988
Optimization, approximation, and complexity classes
Published by Association for Computing Machinery (ACM) ,1988
Non deterministic polynomial optimization problems and their approximations
Theoretical Computer Science, 1981
Toward a unified approach for the classification of NP-complete optimization problems
Theoretical Computer Science, 1980
The complexity of theorem-proving procedures
Published by Association for Computing Machinery (ACM) ,1971