Pages that link to "Item:Q3603454"
From MaRDI portal
The following pages link to A Knapsack Secretary Problem with Applications (Q3603454):
Displayed 22 items.
- The online knapsack problem with incremental capacity (Q283993) (← links)
- The simulated greedy algorithm for several submodular matroid secretary problems (Q290918) (← links)
- Online network design with outliers (Q334928) (← links)
- Analysis of the ``hiring above the median'' selection strategy for the hiring problem (Q378233) (← links)
- Randomized algorithms for online knapsack problems (Q476887) (← links)
- Stochastic models for budget optimization in search-based advertising (Q603917) (← links)
- Optimal composition ordering problems for piecewise linear functions (Q724224) (← 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 Collaborative Filtering on Graphs (Q2830757) (← links)
- How the Experts Algorithm Can Help Solve LPs Online (Q2833109) (← links)
- A Dynamic Near-Optimal Algorithm for Online Linear Programming (Q2931707) (← links)
- Buyback Problem - Approximate Matroid Intersection with Cancellation Costs (Q3012820) (← links)
- Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract) (Q3088096) (← links)
- Prophet Secretary (Q3452813) (← links)
- The Temp Secretary Problem (Q3452826) (← links)
- Primal Beats Dual on Online Packing LPs in the Random-Order Model (Q4554073) (← links)
- The Submodular Secretary Problem Goes Linear (Q4637502) (← links)
- Packing a Knapsack of Unknown Capacity (Q5275439) (← links)
- Prophet Secretary (Q5348218) (← links)
- Longest Increasing Subsequences of Randomly Chosen Multi-Row Arrays (Q5364222) (← links)
- (Q5743511) (← links)