Abstract
Graph theoretic relaxations are used to design tree search algorithms for set-covering and set-partitioning problems. In this paper two assignment relaxations for the set-covering and set-partitioning problems are presented and a tree search method is developed which makes use of these relaxations. Computational experience of processing a collection of test problems is reported.