Secretary Problems via Linear Programming
From MaRDI portal
Publication:3569816
DOI10.1007/978-3-642-13036-6_13zbMath1285.90012OpenAlexW1593308833MaRDI QIDQ3569816
No author found.
Publication date: 22 June 2010
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-13036-6_13
Related Items (7)
Primal-dual analysis for online interval scheduling problems ⋮ A satisficing policy of the secretary problem: theory and simulation ⋮ Optimal Online Selection of an Alternating Subsequence: A Central Limit Theorem ⋮ Secretary markets with local information ⋮ The solution of a generalized secretary problem via analytic expressions ⋮ On variants of the matroid secretary problem ⋮ Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract)
This page was built for publication: Secretary Problems via Linear Programming
