A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering

• 1 December 1996
• journal article
• Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
• Vol. 44  (6) , 875-890
• https://doi.org/10.1287/opre.44.6.875

Abstract

Keywords

• PROCEDURE
• DYNSGRAD
• SUBGRADIENT
• BRANCH AND BOUND ALGORITHM
• DUAL
• SET COVERING