Using the unconstrained quadratic program to model and solve Max 2-SAT problems Online publication date: Wed, 20-Jul-2005
by Gary Kochenberger, Fred Glover, Bahram Alidaee, Karen Lewis
International Journal of Operational Research (IJOR), Vol. 1, No. 1/2, 2005
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.
Online publication date: Wed, 20-Jul-2005
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email firstname.lastname@example.org