Pages that link to "Item:Q3603454"

The following pages link to A Knapsack Secretary Problem with Applications (Q3603454):

Displaying 48 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)
• Scheduling In the random-order model (Q1979454) (← 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)
• Prophet secretary for \(k\)-knapsack and \(l\)-matroid intersection via continuous exchange property (Q2115881) (← links)
• Formal barriers to simple algorithms for the matroid secretary problem (Q2152122) (← links)
• Prior independent mechanisms via prophet inequalities with limited information (Q2278945) (← links)
• New results for the \(k\)-secretary problem (Q2658048) (← links)
• A note on the online interval scheduling secretary problem (Q2670476) (← links)
• The secretary problem with reservation costs (Q2695326) (← 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)
• Online Budgeted Maximum Coverage (Q4606347) (← links)
• The Submodular Secretary Problem Goes Linear (Q4637502) (← links)
• Strong Algorithms for the Ordinal Matroid Secretary Problem (Q5000649) (← links)
• (Q5002749) (← links)
• A Framework for the Secretary Problem on the Intersection of Matroids (Q5087013) (← links)
• (Q5091060) (← links)
• Uniformly Bounded Regret in the Multisecretary Problem (Q5113899) (← links)
• Approximate and exact merging of knapsack constraints with cover inequalities (Q5151546) (← 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)
• Budget-Feasible Mechanism Design for Non-monotone Submodular Objectives: Offline and Online (Q5868957) (← links)
• Improved Online Algorithms for Knapsack and GAP in the Random Order Model (Q5875474) (← links)
• Packing returning secretaries (Q6087124) (← links)
• Machine covering in the random-order model (Q6103518) (← links)
• Relative Worst-Order Analysis: A Survey (Q6163627) (← links)
• Exploiting action impact regularity and exogenous state variables for offline reinforcement learning (Q6488780) (← links)
• Algorithms for maximum social welfare of online random trading (Q6558686) (← links)
• Two-set inequalities for the binary knapsack polyhedra (Q6670502) (← links)