Satisfiability Testing of Boolean Combinations of Pseudo-Boolean Constraints using Local-search Techniques

Author： Liu Lengning   Truszczyński Mirosław  

Publisher： Springer Publishing Company

ISSN： 1383-7133

Source： Constraints, Vol.12, Iss.3, 2007-09, pp. : 345-369

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Theorems Supporting r-flip Search for Pseudo-Boolean Optimization

By  

International Journal of Applied Metaheuristic Computing (IJAMC), Vol. 1, Iss. 1, 2010-01 ,pp. : 93-109

IGI Global_journal

Access to resources Recommend Favorite

Weighted stability number of graphs and weighted satisfiability: The two facets of pseudo-Boolean optimization

By de Werra D.  

Annals of Operations Research, Vol. 149, Iss. 1, 2007-02 ,pp. : 67-73

Springer Publishing Company

Access to resources Recommend Favorite

Incomplete Dynamic Backtracking for Linear Pseudo-Boolean Problems: Hybrid Optimization Techniques (Editors: Narendra Jussien and François Laburthe)

By Prestwich Steven  

Annals of Operations Research, Vol. 130, Iss. 1-4, 2004-08 ,pp. : 57-73

Springer Publishing Company

Access to resources Recommend Favorite

Negative Boolean constraints

By Marriott K.   Odersky M.  

Theoretical Computer Science, Vol. 160, Iss. 1, 1996-06 ,pp. : 365-380

Elsevier

Access to resources Recommend Favorite

A Boolean satisfiability approach to the resource-constrained project scheduling problem

By Horbach Andrei  

Annals of Operations Research, Vol. 181, Iss. 1, 2010-12 ,pp. : 89-107

Springer Publishing Company

Access to resources Recommend Favorite