Pages that link to "Item:Q2508970"
From MaRDI portal
The following pages link to The maximum resource bin packing problem (Q2508970):
Displayed 7 items.
- An asymptotic competitive scheme for online bin packing (Q896124) (← links)
- Competitive analysis of the online inventory problem (Q992666) (← links)
- Hardness of lazy packing and covering (Q1015303) (← links)
- On lazy bin covering and packing problems (Q1041247) (← links)
- An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem (Q1683061) (← links)
- Online lazy bureaucrat scheduling with a machine deadline (Q1702835) (← links)
- Improved approximation algorithms for maximum resource bin packing and lazy bin covering problems (Q2379919) (← links)