The Set-Covering Problem: A New Implicit Enumeration Algorithm

• 1 October 1977
• journal article
• Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
• Vol. 25  (5) , 760-772
• https://doi.org/10.1287/opre.25.5.760

Abstract

Keywords

• NEW IMPLICIT ENUMERATION
• BINARY
• MULTIPLIERS
• PARTITIONING
• OPTIMIZATION
• SOLVING