The following pages link to (Q2707233):
Displaying 10 items.
- Selfish bin covering (Q650947) (← 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)
- Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
- Comparing online algorithms for bin packing problems (Q2434261) (← links)
- The maximum resource bin packing problem (Q2508970) (← links)
- An Incentive Mechanism for Selfish Bin Covering (Q2958351) (← links)
- Ordinal Maximin Share Approximation for Goods (Q5094017) (← links)
- Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing (Q5479859) (← links)
- An on-line bin-batching problem. (Q5929317) (← links)
