The Set-Partitioning Problem: Set Covering with Equality Constraints

R. S. Garfinkel and G. L. Nemhauser
Additional contact information
R. S. Garfinkel: University of Rochester, Rochester, New York
G. L. Nemhauser: The Johns Hopkins University, Baltimore, Maryland

Operations Research, 1969, vol. 17, issue 5, 848-856

Abstract: This paper gives an enumerative algorithm for the set-partitioning problem, that is, the set-covering problem with equality constraints, and presents computational results for real and randomly generated problems. The fact that many problems can be solved more rapidly than the corresponding linear programs demonstrates the efficiency of the algorithm; for example, a randomly generated problem with 1,400 variables and 100 constraints was solved in 15 minutes.

Date: 1969
References: Add references at CitEc
Citations: View citations in EconPapers (13)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.17.5.848 (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:oropre:v:17:y:1969:i:5:p:848-856

Access Statistics for this article

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