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

DOI10.1504/IJMOR.2022.121115zbMATH Open1486.90126OpenAlexW4225602978MaRDI QIDQ2113818FDOQ2113818

Kourosh Eshghi, Maryam Radman

Publication date: 14 March 2022

Published in: International Journal of Mathematics in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1504/ijmor.2022.121115

Recommendations

• 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 Keywords

clustering methodsset covering problemdecomposition techniquesspecial structuresconstraint partitioningSCP

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Approximation methods and heuristics in mathematical programming (90C59) Integer programming (90C10)

Uses Software

• OR-Library

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)