Weighted stability number of graphs and weighted satisfiability: the two facets of pseudo-Boolean optimization
DOI10.1007/S10479-006-0101-0zbMATH Open1213.90016OpenAlexW2067750021MaRDI QIDQ537589FDOQ537589
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
History of mathematics in the 20th century (01A60) Boolean programming (90C09) History of operations research and mathematical programming (90-03)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Stability in CAN-free graphs
Cited In (1)
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)
