Pages that link to "Item:Q1804369"
From MaRDI portal
The following pages link to Stochastic on-line knapsack problems (Q1804369):
Displaying 31 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)
- Improving LTL truck load utilization on line (Q531465) (← links)
- On two-stage stochastic knapsack problems (Q643023) (← links)
- Online minimization knapsack problem (Q897874) (← links)
- On the sum minimization version of the online bin covering problem (Q987687) (← links)
- Upper bounds for the 0-1 stochastic knapsack problem and a B\&B algorithm (Q993710) (← links)
- Online knapsack with resource augmentation (Q1675784) (← links)
- The advice complexity of a class of hard online problems (Q1693995) (← links)
- A class of generalized greedy algorithms for the multi-knapsack problem (Q1803680) (← 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)
- Fractionally subadditive maximization under an incremental knapsack constraint (Q2085751) (← links)
- Online generalized assignment problem with historical information (Q2108140) (← links)
- Online knapsack problem under concave functions (Q2319907) (← links)
- Online knapsack of unknown capacity. How to optimize energy consumption in smartphones (Q2405900) (← links)
- The online knapsack problem: advice and randomization (Q2437775) (← links)
- Online removable knapsack problem under convex function (Q2453163) (← links)
- 2D Knapsack: Packing Squares (Q3004667) (← links)
- Probabilistic Model of Ant Colony Optimization for Multiple Knapsack Problem (Q3616856) (← links)
- Online Knapsack Problem Under Concave Functions (Q4632207) (← links)
- A Theory of Auto-Scaling for Resource Reservation in Cloud Services (Q5046013) (← links)
- Logarithmic Regret in the Dynamic and Stochastic Knapsack Problem with Equal Rewards (Q5119417) (← links)
- Packing a Knapsack of Unknown Capacity (Q5275439) (← links)
- Improved Online Algorithms for Knapsack and GAP in the Random Order Model (Q5875474) (← links)
- Fractionally Subadditive Maximization under an Incremental Knapsack Constraint with Applications to Incremental Flows (Q6202753) (← links)
