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

ISSN： 0254-5330

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

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

Theorems Supporting r-flip Search for Pseudo-Boolean Optimization

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

IGI Global_journal

Access to resources Recommend Favorite

Crossing Number and Weighted Crossing Number of Near-Planar Graphs

By Cabello Sergio Mohar Bojan

Algorithmica, Vol. 60, Iss. 3, 2011-07 ,pp. : 484-504

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

All-Pairs Bottleneck Paths in Vertex Weighted Graphs

By Shapira Asaf Yuster Raphael Zwick Uri

Algorithmica, Vol. 59, Iss. 4, 2011-04 ,pp. : 621-633

Springer Publishing Company

Access to resources Recommend Favorite