Theorems Supporting r-flip Search for Pseudo-Boolean Optimization

Publisher： IGI Global_journal

E-ISSN： 1947-8291|1|1|93-109

ISSN： 1947-8283

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

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

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

By Liu Lengning   Truszczyński Mirosław  

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

Springer Publishing Company

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

Mental image search by boolean composition of region categories

By Fauqueur Julien   Boujemaa Nozha  

Multimedia Tools and Applications, Vol. 31, Iss. 1, 2006-10 ,pp. : 95-117

Springer Publishing Company

Access to resources Recommend Favorite

An efficient top-down search algorithm for learning Boolean networks of gene expression

By Nam Dougu  

Machine Learning, Vol. 65, Iss. 1, 2006-10 ,pp. : 229-245

Springer Publishing Company

Access to resources Recommend Favorite