Balas, Egon; Ho, Andrew Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study. (English) Zbl 0435.90074 Math. Program. Study 12, 37-60 (1980). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 2 ReviewsCited in 91 Documents MSC: 90C10 Integer programming 65K05 Numerical mathematical programming methods 68Q60 Specification and verification (program logics, model checking, etc.) Keywords:set covering algorithms; cutting planes, heuristics; subgradient optimization; computational study; implementation; computational testing; prime covers; lower bounds; implicit enumeration; branching rules; branch and bound; conditional bounds; random test problems; comparison of algorithms Citations:Zbl 0435.90073 PDF BibTeX XML Cite \textit{E. Balas} and \textit{A. Ho}, Math. Program. Study 12, 37--60 (1980; Zbl 0435.90074) Full Text: DOI