The following pages link to (Q4737165):
Displayed 37 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 maximum matching with recourse (Q830934) (← 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 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 algorithms for the maximum \(k\)-interval coverage problem (Q2091105) (← 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)
- Lower bounds on the performance of online algorithms for relaxed packing problems (Q2169944) (← 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)
- Online Maximum Matching with Recourse (Q5005104) (← links)
- A Theory of Auto-Scaling for Resource Reservation in Cloud Services (Q5046013) (← 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)
- Online knapsack with removal and recourse (Q6182898) (← links)
- Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem (Q6202754) (← links)