Pages that link to "Item:Q2453163"
From MaRDI portal
The following pages link to Online removable knapsack problem under convex function (Q2453163):
Displaying 10 items.
- Online knapsack revisited (Q260271) (← 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)
- Packing a Knapsack of Unknown Capacity (Q5275439) (← links)
- Proportional Cost Buyback Problem with Weight Bounds (Q5743550) (← links)
- Relaxing the irrevocability requirement for online graph algorithms (Q5918715) (← links)