The following pages link to (Q2768348):
Displaying 20 items.
- The generalized assignment problem with minimum quantities (Q257215) (← links)
- Selfish bin covering (Q650947) (← links)
- Packing resizable items with application to video delivery over wireless networks (Q742419) (← links)
- Class constrained bin covering (Q970104) (← links)
- Asymptotic fully polynomial approximation schemes for variants of open-end bin packing (Q975519) (← links)
- On the sum minimization version of the online bin covering problem (Q987687) (← links)
- Hardness of lazy packing and covering (Q1015303) (← links)
- Hardness of approximation for orthogonal rectangle packing and covering problems (Q1026242) (← links)
- Bounded-space online bin cover (Q1041340) (← links)
- An asymptotic fully polynomial time approximation scheme for bin covering. (Q1426473) (← links)
- Improved approximation algorithms for maximum resource bin packing and lazy bin covering problems (Q2379919) (← links)
- Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
- Bin covering with cardinality constraints (Q2446840) (← links)
- Bin packing problems with rejection penalties and their dual problems (Q2495654) (← links)
- The maximum resource bin packing problem (Q2508970) (← links)
- Online bin covering with limited migration (Q2689369) (← links)
- An Incentive Mechanism for Selfish Bin Covering (Q2958351) (← links)
- Online Bin Covering with Limited Migration (Q5075753) (← links)
- Ordinal Maximin Share Approximation for Goods (Q5094017) (← links)
- Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing (Q5479859) (← links)
