A Linearization technique for solving the quadratic set covering problem

References

• Arora , S.R. and Puri , M.C. 1977 . Enumeration Technique for the Set Covering Problem with Linear Fractional Functional as it’s Objective Function . ZAMM , 57 : 181 – 186 .
   Web of Science ®Google Scholar
• Arora , S.R. , Swarup , Kanti. and Puri , M.C. 1977 . An Enumerative Technique for the Set Covering Problem . NRZOR , 5 ( 2 ) : 119 – 128 .
   Google Scholar
• Bazaraa , M.S. and Goode , J.J. 1975 . A Cutting Plane Algorithm for the Quadratic Set Covering Problem . Opns. Res , 23 ( 1 )
   Web of Science ®Google Scholar
• Bector , C.R. and Bhatt , S.K. 1975 . A Linearization Technique for Solving Integral Linear Fractional Program . Proc. fifth Manitoba Conlerence on Numerical Mathematics . 1975 . pp. 221 – 229 .
   Google Scholar
• Bellmore , M. and Ratliff , G.L. 1971 . Set Covering and Involutory Basis . Management Science , 18 : 194 – 206 .
   Web of Science ®Google Scholar
• Garfinkel , M. and Nemhauser , G.L. 1973 . “ Integer Programming ” . A Wiley-Interscience Publication . John Wiley and Sons
   Google Scholar
• Lemke , C.E. , Salkin , H.M. and Spielberg , K. 1971 . Set Covering by Single Branch Enumeration with Linear Programming Sub-Problem . Operations Research , 19 : 998 – 1022 .
   Web of Science ®Google Scholar
• Roth , R. 1969 . Computer Solution to Minimum Cover Problem . Operations Resrarch , 17 ( 3 ) : 455 – 465 .
   Web of Science ®Google Scholar