Accession Number : AD0769125
Title : Set Covering by Ordinal Cuts I: Linear Objective Functions.
Descriptive Note : Management sciences research rept.,
Corporate Author : CARNEGIE-MELLON UNIV PITTSBURGH PA MANAGEMENT SCIENCES RESEARCH GROUP
Personal Author(s) : Bowman,V. Joseph ; Starr,James H.
Report Date : JUN 1973
Pagination or Media Count : 27
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.
Descriptors : (*Mathematical programming, Algorithms), Set theory, Theorems, Computations, FORTRAN
Subject Categories : Operations Research
Distribution Statement : APPROVED FOR PUBLIC RELEASE