Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics

Marshall L. Fisher and Pradeep Kedia
Additional contact information
Marshall L. Fisher: Department of Decision Sciences, The Wharton School, University of Pennsylvania, Philadelphia, Pennsylvania 19104-6366
Pradeep Kedia: College of Business Administration, Northeastern University, Boston, Massachusetts 02115

Management Science, 1990, vol. 36, issue 6, 674-688

Abstract: We present an algorithm for a mixed set covering/partitioning model that includes as special cases the well-known set covering problem and set partitioning problem. The novel feature of our algorithm is the use of continuous heuristics applied to the dual of the linear programming relaxation to provide lower bounds for a branch and bound algorithm. The heuristics are continuous adaptations of the well-known greedy and 3-opt methods that have been applied to a variety of combinatorial optimization problems. Our algorithm has outperformed the current best set covering algorithm of Balas and Ho (1980) by about a factor of 3, and appears to improve on the best existing set partitioning algorithm by more than an order of magnitude.

Keywords: set covering; set partitioning; optimization; Lagrangean relaxation (search for similar items in EconPapers)
Date: 1990
References: Add references at CitEc
Citations: View citations in EconPapers (28)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.36.6.674 (application/pdf)

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:inm:ormnsc:v:36:y:1990:i:6:p:674-688

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().