In this article we present a heuristic algorithm for non-unicost set-covering problems based upon Lagrangian relaxation and subgradient optimization. Computational results, based upon problems involving up to 1000 rows and 10000 columns, indicate that this heuristic produces better-quality results than a number of other heuristics.
No takes yet. Share an insight, caveat, or question.
J. E. Beasley (1990) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: