Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study

Publisher Website

1 January 1980

book chapter
Published by Springer Nature

p. 37-60
https://doi.org/10.1007/bfb0120886

Abstract

No abstract available

This publication has 6 references indexed in Scilit:

Cutting planes from conditional bounds: A new approach to set covering
Published by Springer Nature ,1980
On convergence rates of subgradient optimization methods
Mathematical Programming, 1977
The Set-Covering Problem: A New Implicit Enumeration Algorithm
Operations Research, 1977
Validation of subgradient optimization
Mathematical Programming, 1974
Set Covering by an All Integer Algorithm
Journal of the ACM, 1973
Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems
Operations Research, 1971