An algorithm to find the smallest committee containing a given set
From MaRDI portal
Publication:1080373
zbMath0598.90109MaRDI QIDQ1080373
Publication date: 1986
Published in: Opsearch (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Game theory (91A99)
Related Items (2)
The complexity of modular decomposition of Boolean functions ⋮ Preface: International conference on game theory and optimization, June 6--10, 2016, Indian Institute of Technology Madras, Chennai, India
This page was built for publication: An algorithm to find the smallest committee containing a given set
