Granot, Daniel; Granot, Frieda; Kallberg, Jerry Covering relaxation for positive 0-1 polynomial programs. (English) Zbl 0415.90058 Manage. Sci. 25, 264-273 (1979). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 1 ReviewCited in 7 Documents MSC: 90C09 Boolean programming 68Q60 Specification and verification (program logics, model checking, etc.) Keywords:polynomial constraint; non-negative coefficients; linear covering problem; cutting-plane algorithm; positive 0-1 polynomial program; implicit enumeration; relaxation; algorithmic performance; computational study; random test problems Citations:Zbl 0253.90038; Zbl 0322.90043 × Cite Format Result Cite Review PDF Full Text: DOI