Shih, Wei A branch and bound method for the multiconstraint zero-one knapsack problem. (English) Zbl 0411.90050 J. Oper. Res. Soc. 30, 369-378 (1979). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 54 Documents MSC: 90C09 Boolean programming 65K05 Numerical mathematical programming methods 68Q60 Specification and verification (program logics, model checking, etc.) Keywords:boolean programming; Integer Programming; search process; estimation of the upper bound; m-constraint knapsack problem; balas method; generalized knapsack problem; branch and bound method; computational experience; algorithmic performance; comparison of algorithms PDF BibTeX XML Cite \textit{W. Shih}, J. Oper. Res. Soc. 30, 369--378 (1979; Zbl 0411.90050) Full Text: DOI OpenURL