A novel decomposition approach to set covering problems by exploiting special structures

Maryam Radman and Kourosh Eshghi

International Journal of Mathematics in Operational Research, 2022, vol. 21, issue 2, 254-279

Abstract: The set covering problem (SCP) has quite a large coefficient matrix in practical problems, but due to its low density, most of its entries are zero. Drawing on this observation, some methods can be developed to exploit special structures of the coefficient matrix of an SCP in such a way that they contain smaller dense subproblems. Against this backdrop, in this paper, three structures, namely 'partitioned', 'semi-block angular', and 'block angular', are proposed. To begin with, some heuristic methods are presented to exploit these structures of the coefficient matrices of SCPs; then, by optimally solving the smaller subproblems of these structures, their solutions are used to solve the whole problem based on the proposed theorem. Our approach has been tested using well-known instances from OR-Library and shown to be comparable with some of the recently-developed methods to solve SCPs.

Keywords: set covering problem; SCP; constraint partitioning; decomposition techniques; special structures; clustering methods. (search for similar items in EconPapers)
Date: 2022
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=121115 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:21:y:2022:i:2:p:254-279

Access Statistics for this article

More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().