Using the unconstrained quadratic program to model and solve Max 2-SAT problems

Gary Kochenberger, Fred Glover, Bahram Alidaee and Karen Lewis

International Journal of Operational Research, 2005, vol. 1, issue 1/2, 89-100

Abstract: Satisfiability (SAT) and Max-SAT problems have been the object of considerable research effort over the past few decades. They remain a very important research area today due to their computational challenge and application importance. In this paper, we investigate the use of penalty functions to recast SAT problems into the modelling framework offered by the unconstrained quadratic binary program. Computational experience is presented, illustrating how promising this approach is for Max 2-Sat problems.

Keywords: satisfiability; metaheuristics; Tabu search; penalty functions; unconstrained quadratic program; Max 2-SAT problems; combinatorial optimisation. (search for similar items in EconPapers)
Date: 2005
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www.inderscience.com/link.php?id=7435 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:1:y:2005:i:1/2:p:89-100

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().