A novel decomposition approach to set covering problems by exploiting special structures
Summary: 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.
- An approach to the solution of the set-covering problem
- A decomposition strategy for the vertex cover problem
- scientific article; zbMATH DE number 800301
- Solution of Set-Covering and Set-Partitioning Problems Using Assignment Relaxations
- A special case of set covering problems
- Exact algorithms for set multicover and multiset multicover problems
- A dissection of the duality gap of set covering problems
- Decomposition techniques applied to the clique-stable set separation problem
- Benders decomposition for set covering problems. Almost satisfying the consecutive ones property
- scientific article; zbMATH DE number 4106856
This page was built for publication: A novel decomposition approach to set covering problems by exploiting special structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2113818)
