Solving set covering problems of large dimension
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 5990470
- Algorithms for large scale set covering problems
- An efficient heuristic for large set covering problems
- An algorithm for set covering problem
- The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems
Cited in
(8)- The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems
- Exact cover problem in Milton Babbitt's all-partition array
- A nested decomposition approach for a large scale set covering problem: a model with a variety of applications in Industry 4.0
- scientific article; zbMATH DE number 4106856 (Why is no real title available?)
- scientific article; zbMATH DE number 1107517 (Why is no real title available?)
- Benders decomposition for set covering problems. Almost satisfying the consecutive ones property
- Benchmark data set with service programs to approximately solve the set covering problem
- Solution techniques for the large set covering problem
This page was built for publication: Solving set covering problems of large dimension
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3105856)
