Pages that link to "Item:Q4225866"
From MaRDI portal
The following pages link to Average-Case Analysis of Off-Line and On-Line Knapsack Problems (Q4225866):
Displaying 16 items.
- Online knapsack revisited (Q260271) (← links)
- The online knapsack problem with incremental capacity (Q283993) (← links)
- Randomized algorithms for online knapsack problems (Q476887) (← links)
- Online unweighted knapsack problem with removal cost (Q486978) (← links)
- Smoothed analysis of integer programming (Q877191) (← links)
- On the sum minimization version of the online bin covering problem (Q987687) (← links)
- Stochastic on-line knapsack problems (Q1804369) (← links)
- Average-case analysis of a greedy algorithm for the 0/1 knapsack problem. (Q1811628) (← 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 generalized assignment problem with historical information (Q2108140) (← links)
- Average-case performance of rollout algorithms for knapsack problems (Q2349849) (← links)
- Online knapsack of unknown capacity. How to optimize energy consumption in smartphones (Q2405900) (← links)
- Logarithmic Regret in the Dynamic and Stochastic Knapsack Problem with Equal Rewards (Q5119417) (← links)
- Improved Online Algorithms for Knapsack and GAP in the Random Order Model (Q5875474) (← links)
- Random knapsack in expected polynomial time (Q5917572) (← links)