Pages that link to "Item:Q3603464"
From MaRDI portal
The following pages link to Optimal Resource Augmentations for Online Knapsack (Q3603464):
Displayed 13 items.
- The online knapsack problem with incremental capacity (Q283993) (← links)
- 2D knapsack: packing squares (Q388093) (← links)
- Online removable knapsack with limited cuts (Q410717) (← links)
- Randomized algorithms for online knapsack problems (Q476887) (← links)
- Online unweighted knapsack problem with removal cost (Q486978) (← links)
- Recurring concept memory management in data streams: exploiting data stream concept evolution to improve performance and transparency (Q2036734) (← links)
- Online knapsack problem under concave functions (Q2319907) (← links)
- Unit cost buyback problem (Q2322706) (← links)
- Online removable knapsack problem under convex function (Q2453163) (← links)
- 2D Knapsack: Packing Squares (Q3004667) (← links)
- Online Knapsack Problem Under Concave Functions (Q4632207) (← links)
- Online Submodular Maximization Problem with Vector Packing Constraint. (Q5111710) (← links)
- Proportional Cost Buyback Problem with Weight Bounds (Q5743550) (← links)