A nested decomposition approach for a large scale set covering problem: a model with a variety of applications in Industry 4.0

DOI10.1007/978-3-030-28565-4_17MaRDI QIDQ3299233zbMATH OpenOpenAlexFDO

Authors Maryam Radman, Kourosh Eshghi

Publication date 20 July 2020

Published in Optimization in Large Scale Problems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-28565-4_17

zbMATH Keywords

set coveringdecomposition techniquesconstraint partitioningblock-angular

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Production models (90B30)

Recommendations

• A novel decomposition approach to set covering problems by exploiting special structures
• Algorithms for large scale set covering problems
• Solving set covering problems of large dimension
• Algorithms for the set covering problem
• RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A Heuristic Method for the Set Covering Problem
• Benders decomposition for set covering problems. Almost satisfying the consecutive ones property
• RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)

Describes a project that uses

Uses Software

• OR-Library

This page was built for publication: A nested decomposition approach for a large scale set covering problem: a model with a variety of applications in Industry 4.0

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3299233)