Pages that link to "Item:Q2446840"
From MaRDI portal
The following pages link to Bin covering with cardinality constraints (Q2446840):
Displaying 11 items.
- Class constrained bin covering (Q970104) (← links)
- On the sum minimization version of the online bin covering problem (Q987687) (← links)
- On lazy bin covering and packing problems (Q1041247) (← links)
- An asymptotic fully polynomial time approximation scheme for bin covering. (Q1426473) (← links)
- Lower bounds and algorithms for the minimum cardinality bin covering problem (Q1752204) (← links)
- Irreducible bin packing and normality in routing open shop (Q2240719) (← links)
- Lower bounds for online bin covering-type problems (Q2304119) (← links)
- A PTAS for the cardinality constrained covering with unit balls (Q2437774) (← links)
- Two simple algorithms for bin covering (Q2707233) (← links)
- (Q3021055) (← links)
- Optimal Bin Covering with Items of Random Size (Q3830822) (← links)