Abstract
We introduce a new NP-complete problem, which is denoted SAT01. It turns out that many other NP problems can be reduced to SAT01 easily and the new introduced SAT01 variables have natural meanings at that. We develop a propagation method for SAT01 that gives an opportunity to perform its reduction and to recognize hidden binary relations among variables. Besides, since the problem is formulated as a system of linear equations and inequalities for binary variables we are able to use heuristics based on solving of the real relaxation of its constraints. Due to all these properties we have solved many hard instances of different NP problems with good performance.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Balas, E., Padberg, W.M.: Set Partitioning: A survey. SIAM Review 18, 810–861 (1976)
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Busygin, S. (1999). On SAT01 Problem. In: Jaffar, J. (eds) Principles and Practice of Constraint Programming – CP’99. CP 1999. Lecture Notes in Computer Science, vol 1713. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48085-3_34
Download citation
DOI: https://doi.org/10.1007/978-3-540-48085-3_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66626-4
Online ISBN: 978-3-540-48085-3
eBook Packages: Springer Book Archive