On a Generalization of the Best Choice Problem
From MaRDI portal
Cited in
(8)- scientific article; zbMATH DE number 7077336 (Why is no real title available?)
- Improved Online Algorithms for Knapsack and GAP in the Random Order Model
- Improved online algorithms for knapsack and GAP in the random order model
- Optimal selection of the four best of a sequence
- Optimal choice and assignment of the best \(m\) of \(n\) randomly arriving items
- Some Extensions of Generalized Secretary Problem
- Optimal stopping methodology for the secretary problem with random queries
- Optimal selection of the \(k\) best of a sequence with \(k\) stops
This page was built for publication: On a Generalization of the Best Choice Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4157353)