A lagrangian heuristic for set‐covering problems

John Beasley

Naval Research Logistics (NRL), 1990, vol. 37, issue 1, 151-164

Abstract: 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.

Date: 1990
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (16)

Downloads: (external link)
https://doi.org/10.1002/1520-6750(199002)37:13.0.CO;2-2

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navres:v:37:y:1990:i:1:p:151-164

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().