Algorithms for the maximum satisfiability problem
Pierre Hansen, Brigitte Jaumard · Computing · 1990
Cited by 360 works. doi:10.1007/bf02241270
Authors
References
- Computers and Intractability: A Guide to the Theory of NP-Completeness
- Optimization by Simulated Annealing
- Equation of State Calculations by Fast Computing Machines
- Reducibility among Combinatorial Problems
- The complexity of theorem-proving procedures
- A Computing Procedure for Quantification Theory
- Tabu Search—Part II
- Approximation algorithms for combinatorial problems
- Tabu Search—Part I
- Some simplified NP-complete graph problems