Experiments with parallel branch-and-bound algorithms for the set covering problem

Russell A. Rushmeier, George L. Nemhauser. Experiments with parallel branch-and-bound algorithms for the set covering problem. Oper. Res. Lett., 13(5):277-285, 1993. [doi]

Abstract

Abstract is missing.