A Knapsack Secretary Problem with Applications
From MaRDI portal
Publication:3603454
Recommendations
- scientific article; zbMATH DE number 4005976
- scientific article; zbMATH DE number 1302173
- scientific article; zbMATH DE number 3852791
- The constrained compartmentalised knapsack problem
- Knapsack problems: a parameterized point of view
- Knapsack problems with setups
- The knapsack problem with a minimum filling constraint
- scientific article; zbMATH DE number 4031399
Cited in
(50)- Two-set inequalities for the binary knapsack polyhedra
- A note on the online interval scheduling secretary problem
- Packing a knapsack of unknown capacity
- Secretary problems with convex costs
- Stochastic models for budget optimization in search-based advertising
- Prophet secretary
- Prior independent mechanisms via prophet inequalities with limited information
- Upper bounds for the 0-1 stochastic knapsack problem and a B\&B algorithm
- The simulated greedy algorithm for several submodular matroid secretary problems
- Algorithms for maximum social welfare of online random trading
- A dynamic near-optimal algorithm for online linear programming
- Prophet secretary for \(k\)-knapsack and \(l\)-matroid intersection via continuous exchange property
- Knapsack secretary through boosting
- Maximizing profit with convex costs in the random-order model
- Improved online algorithm for fractional knapsack in the random order model
- The online knapsack problem with incremental capacity
- Buyback problem -- approximate matroid intersection with cancellation costs
- Adversarial bandits with knapsacks
- New results for the \(k\)-secretary problem
- Exploiting action impact regularity and exogenous state variables for offline reinforcement learning
- Strong algorithms for the ordinal matroid secretary problem
- Packing returning secretaries
- Formal barriers to simple algorithms for the matroid secretary problem
- A Framework for the Secretary Problem on the Intersection of Matroids
- Packing returning secretaries
- Analysis of the ``hiring above the median selection strategy for the hiring problem
- Machine covering in the random-order model
- Uniformly bounded regret in the multisecretary problem
- Online budgeted maximum coverage
- Online generalized assignment problem with historical information
- Relative Worst-Order Analysis: A Survey
- Improved online algorithms for knapsack and GAP in the random order model
- Online algorithms for the maximum \(k\)-interval coverage problem
- Primal beats dual on online packing LPs in the random-order model
- Optimal composition ordering problems for piecewise linear functions
- Online collaborative filtering on graphs
- Scheduling In the random-order model
- Budget-feasible mechanism design for non-monotone submodular objectives: offline and online
- Randomized algorithms for online knapsack problems
- Improved competitive ratio for the matroid secretary problem
- The Temp Secretary Problem
- Improved competitive ratios for submodular secretary problems (extended abstract)
- Improved Online Algorithms for Knapsack and GAP in the Random Order Model
- Online network design with outliers
- On the sum minimization version of the online bin covering problem
- Longest Increasing Subsequences of Randomly Chosen Multi-Row Arrays
- Prophet secretary
- Approximate and exact merging of knapsack constraints with cover inequalities
- The secretary problem with reservation costs
- The submodular secretary problem goes linear
This page was built for publication: A Knapsack Secretary Problem with Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3603454)
