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

DOI10.1007/S10479-006-0101-0MaRDI QIDQ537589zbMATH OpenOpenAlexFDO

Authors Peter L. Hammer, Dominique De Werra

Publication date 20 May 2011

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://infoscience.epfl.ch/record/104088/files/10479_2006_Article_101.pdf

Mathematics Subject Classification ID

History of mathematics in the 20th century (01A60) Boolean programming (90C09) History of operations research and mathematical programming (90-03)

Cites work

• scientific article; zbMATH DE number 3904619 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3400923 (Why is no real title available?)
• On the use of Boolean methods for the computation of the stability number
• Polynomially solvable cases for the maximum stable set problem
• Stability in CAN-free graphs
• Struction revisited
• The struction of a graph: Application to CN-free graphs

Cited in

(1)

• Stability preserving transformations of graphs

This page was built for publication: Weighted stability number of graphs and weighted satisfiability: the two facets of pseudo-Boolean optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q537589)