Pages that link to "Item:Q3075446"
From MaRDI portal
The following pages link to New Lower Bounds for Certain Classes of Bin Packing Algorithms (Q3075446):
Displaying 14 items.
- Bin packing with ``largest in bottom'' constraint: tighter bounds and generalizations (Q385496) (← links)
- New lower bounds for certain classes of bin packing algorithms (Q441876) (← links)
- Online square packing with gravity (Q476449) (← links)
- Station assignment with reallocation (Q666668) (← links)
- An asymptotic competitive scheme for online bin packing (Q896124) (← links)
- Lower bounds and reduction procedures for the bin packing problem (Q917446) (← links)
- Improved bounds for harmonic-based bin packing algorithms (Q1182320) (← links)
- A new lower bound on the price of anarchy of selfish bin packing (Q2274500) (← links)
- Fully dynamic bin packing revisited (Q2288188) (← links)
- NF-based algorithms for online bin packing with buffer and bounded item size (Q2355990) (← links)
- On-line bin packing with restricted repacking (Q2436663) (← links)
- NF-Based Algorithms for Online Bin Packing with Buffer and Item Size Limitation (Q2867105) (← links)
- (Q4723300) (← links)
- A new lower bound for classic online bin packing (Q5918895) (← links)