The following pages link to Online knapsack revisited (Q260271):
Displaying 20 items.
- The online knapsack problem with incremental capacity (Q283993) (← links)
- Randomized algorithms for online knapsack problems (Q476887) (← links)
- Online minimization knapsack problem (Q897874) (← links)
- Online algorithms with advice for the dual bin packing problem (Q1642809) (← links)
- Online knapsack with resource augmentation (Q1675784) (← links)
- Online budgeted maximum coverage (Q1979466) (← links)
- Improved online algorithms for Knapsack and GAP in the random order model (Q2032350) (← links)
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
- Lower bounds on the performance of online algorithms for relaxed packing problems (Q2169944) (← links)
- Online knapsack problem under concave functions (Q2319907) (← links)
- Online knapsack of unknown capacity. How to optimize energy consumption in smartphones (Q2405900) (← links)
- Online removable knapsack problem under convex function (Q2453163) (← links)
- Optimal Resource Augmentations for Online Knapsack (Q3603464) (← links)
- Online Knapsack Problems with Limited Cuts (Q3652222) (← links)
- Online Knapsack Problem Under Concave Functions (Q4632207) (← links)
- A Theory of Auto-Scaling for Resource Reservation in Cloud Services (Q5046013) (← links)
- A Simple PTAS for the Dual Bin Packing Problem and Advice Complexity of Its Online Version (Q5240422) (← 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)
- Online unit profit knapsack with predictions (Q6614107) (← links)
