This paper is a survey of available methods for the solution of the Set Covering Problem. The prime objective has been to establish the computational efficiency and relative merits of the various ...
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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback