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

DOI10.1007/s10479-006-0101-0zbMath1213.90016OpenAlexW2067750021MaRDI QIDQ537589

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)

Related Items

Stability preserving transformations of graphs

Cites Work

• Stability in CAN-free graphs
• The struction of a graph: Application to CN-free graphs
• On the use of Boolean methods for the computation of the stability number
• Struction revisited
• Polynomially solvable cases for the maximum stable set problem
• Unnamed Item
• Unnamed Item
• Unnamed Item