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.
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
El-Darzi, E., Mitra, G. Solution of Set-Covering and Set-Partitioning Problems Using Assignment Relaxations. J Oper Res Soc 43, 483–493 (1992). https://doi.org/10.1057/jors.1992.74
Published:
Issue Date:
DOI: https://doi.org/10.1057/jors.1992.74