Set Covering by Ordinal Cuts I: Linear Objective Functions.
Abstract
In the paper, a partial ordering on the vertices of the unit hypercube is used to define a set, Z, of solutions to the set covering problem which must contain the optimal solution. An element of Z can be easily obtained and the partial ordering is then used to construct a constraint that eliminates previously generated elements of Z. This cut leads to a simple enumerative algorithm. Finally, computational results are presented.
Document Details
- Document Type
- Technical Report
- Publication Date
- Jun 01, 1973
- Accession Number
- AD0769125
Entities
People
- James H. Starr
- V. Joseph Bowman
Organizations
- Carnegie Mellon University