Submodular integer cover and its application to production planning
From MaRDI portal
Recommendations
- On approximation of the submodular set cover problem
- Prize‐collecting set multicovering with submodular pricing
- Primal-dual approximation algorithms for submodular cost set cover problems with linear/submodular penalties
- A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem
- The multi‐integer set cover and the facility terminal cover problem
Cited in
(6)- Primal-dual algorithms for precedence constrained covering problems
- Primal-dual algorithms for precedence constrained covering problems
- On product covering in supply chain models: Natural complete problems for \(W[3]\) and \(W[4]\)
- On improved interval cover mechanisms for crowdsourcing markets
- Approximability of sparse integer programs
- Analysis of fractional covering of some supply management problems
This page was built for publication: Submodular integer cover and its application to production planning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5713434)