Solution of Set-Covering and Set-Partitioning Problems Using Assignment Relaxations
提出两种指派松弛方法，并开发了基于这些松弛的树搜索算法，用于求解集合覆盖和集合划分问题，报告了测试问题的计算经验。
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.