A set-covering problem: the combinatorial-local approach and the branch and bound method

Publisher Website

1 January 1979

journal article
Published by Elsevier in USSR Computational Mathematics and Mathematical Physics

Vol. 19 (6) , 217-226
https://doi.org/10.1016/0041-5553(79)90050-8

Abstract

No abstract available

Keywords

This publication has 8 references indexed in Scilit:

Integer Programming Algorithms: A Framework and State-of-the-Art Survey
Management Science, 1972
Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems
Operations Research, 1971
Computer Solutions to Minimum-Cover Problems
Operations Research, 1969
An Improved Implicit Enumeration Approach for Integer Programming
Operations Research, 1969
Branch-and-Bound Methods: A Survey
Operations Research, 1966
Integer Programming: Methods, Uses, Computations
Management Science, 1965
An Additive Algorithm for Solving Linear Programs with Zero-One Variables
Operations Research, 1965
Minimization of Boolean Functions*
Bell System Technical Journal, 1956