A Cutting-Plane Algorithm for the Quadratic Set-Covering Problem

Mokhtar S. Bazaraa and Jamie J. Goode
Additional contact information
Mokhtar S. Bazaraa: Georgia Institute of Technology, Atlanta, Georgia
Jamie J. Goode: Georgia Institute of Technology, Atlanta, Georgia

Operations Research, 1975, vol. 23, issue 1, 150-158

Abstract: This paper develops an algorithm to solve certain quadratic set-covering problems where the constraint set is of the inequality type. It extends one of B ellmore and R atliff for linear set-covering problems with involutory bases where cutting planes that exclude both integer and noninteger solutions are generated at each iteration. The new algorithm can be used to solve problems of the equality and mixed types by introducing a penalty term in the objective function. Computational experience with the new algorithm is presented.

Date: 1975
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.23.1.150 (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:23:y:1975:i:1:p:150-158

Access Statistics for this article

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