The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems
Open Access
- 31 July 1994
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 21 (6) , 689-705
- https://doi.org/10.1016/0305-0548(94)90083-3
Abstract
No abstract availableThis publication has 22 references indexed in Scilit:
- Optimal Solution of Set Covering/Partitioning Problems Using Dual HeuristicsManagement Science, 1990
- On the set covering polytope: II. Lifting the facets with coefficients in {0, 1, 2}Mathematical Programming, 1989
- On the set covering polytope: I. All the facets with coefficients in {0, 1, 2}Mathematical Programming, 1989
- On the 0, 1 facets of the set covering polytopeMathematical Programming, 1989
- An algorithm for set covering problemEuropean Journal of Operational Research, 1987
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational studyPublished by Springer Nature ,1980
- Cutting planes from conditional bounds: A new approach to set coveringPublished by Springer Nature ,1980
- The Set-Covering Problem: A New Implicit Enumeration AlgorithmOperations Research, 1977
- Set Partitioning: A surveySIAM Review, 1976
- Set Covering by Single-Branch Enumeration with Linear-Programming SubproblemsOperations Research, 1971