Pages that link to "Item:Q5363009"
From MaRDI portal
The following pages link to The optimal absolute ratio for online bin packing (Q5363009):
Displayed 14 items.
- Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
- An asymptotic competitive scheme for online bin packing (Q896124) (← links)
- Colored bin packing: online algorithms and lower bounds (Q1702125) (← links)
- More on batched bin packing (Q1785762) (← links)
- Online packing of arbitrary sized items into designated and multipurpose bins (Q2001455) (← links)
- Batch scheduling of nonidentical job sizes with minsum criteria (Q2051908) (← links)
- Fully dynamic bin packing revisited (Q2288188) (← links)
- Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
- Bounds for online bin packing with cardinality constraints (Q2629856) (← links)
- Online two-dimensional vector packing with advice (Q2692736) (← links)
- (Q5009562) (← links)
- Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty (Q5046625) (← links)
- Interior-Point-Based Online Stochastic Bin Packing (Q5144776) (← links)
- A 4-space bounded approximation algorithm for online bin packing problem (Q6113869) (← links)