The following pages link to (Q4737165):
Displayed 23 items.
- Online knapsack revisited (Q260271) (← links)
- 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)
- Online minimization knapsack problem (Q897874) (← links)
- Online removable square packing (Q927402) (← links)
- On the sum minimization version of the online bin covering problem (Q987687) (← links)
- Competitive analysis of online real-time scheduling algorithms under hard energy constraint (Q993512) (← links)
- Priority algorithms for the subset-sum problem (Q1029701) (← links)
- Online knapsack with resource augmentation (Q1675784) (← links)
- On extensions of the deterministic online model for bipartite matching and max-sat (Q1740687) (← links)
- Buyback problem with discrete concave valuation functions (Q1751249) (← 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)
- The online knapsack problem: advice and randomization (Q2437775) (← links)
- Online removable knapsack problem under convex function (Q2453163) (← links)
- Online Knapsack Problem Under Concave Functions (Q4632207) (← links)
- Online Submodular Maximization with Preemption (Q4972676) (← links)
- Packing a Knapsack of Unknown Capacity (Q5275439) (← links)