Pages that link to "Item:Q476887"
From MaRDI portal
The following pages link to Randomized algorithms for online knapsack problems (Q476887):
Displayed 17 items.
- The online knapsack problem with incremental capacity (Q283993) (← links)
- Online minimization knapsack problem (Q897874) (← links)
- Online budgeted maximum coverage (Q1979466) (← links)
- Improved online algorithms for Knapsack and GAP in the random order model (Q2032350) (← links)
- Improved online algorithm for fractional knapsack in the random order model (Q2085749) (← links)
- Online generalized assignment problem with historical information (Q2108140) (← links)
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
- Online knapsack problem under concave functions (Q2319907) (← links)
- Unit cost buyback problem (Q2322706) (← links)
- Online knapsack of unknown capacity. How to optimize energy consumption in smartphones (Q2405900) (← links)
- Proportional cost buyback problem with weight bounds (Q2424877) (← links)
- Online Knapsack Problem Under Concave Functions (Q4632207) (← links)
- Online Submodular Maximization Problem with Vector Packing Constraint. (Q5111710) (← links)
- Packing a Knapsack of Unknown Capacity (Q5275439) (← links)
- Improved Online Algorithms for Knapsack and GAP in the Random Order Model (Q5875474) (← links)
- Relaxing the irrevocability requirement for online graph algorithms (Q5918715) (← links)
- Learning-augmented algorithms for online subset sum (Q6064057) (← links)