Pages that link to "Item:Q2408089"
From MaRDI portal
The following pages link to Primal-dual algorithms for precedence constrained covering problems (Q2408089):
Displaying 10 items.
- Clique-based facets for the precedence constrained knapsack problem (Q431007) (← links)
- Precedence-constrained covering problems with multiplicity constraints (Q2085754) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem (Q2217463) (← links)
- From valid inequalities to heuristics: A unified view of primal-dual approximation algorithms in covering problems (Q2770094) (← links)
- (Q4383642) (← links)
- A Water-Filling Primal-Dual Algorithm for Approximating NonLinear Covering Problems (Q5058125) (← links)
- Precedence-Constrained Min Sum Set Cover (Q5136276) (← links)
- Precedence-constrained covering problems with multiplicity constraints (Q6039535) (← links)
- Minimization problems with non-submodular cover constraint (Q6542984) (← links)