Secretary Problems via Linear Programming
From MaRDI portal
Publication:3569816
DOI10.1007/978-3-642-13036-6_13zbMATH Open1285.90012OpenAlexW1593308833MaRDI QIDQ3569816FDOQ3569816
Authors:
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
Recommendations
- Secretary Problems via Linear Programming
- The Secretary Problem with Optimal Assignment
- scientific article; zbMATH DE number 3986306
- A generalized secretary problem
- The submodular secretary problem goes linear
- Secretary problems with convex costs
- Secretary problems: laminar matroid and interval scheduling
- APPROXIMATE RESULTS FOR A GENERALIZED SECRETARY PROBLEM
- Some Extensions of Generalized Secretary Problem
- The solution of a generalized secretary problem via analytic expressions
Cited In (15)
- Title not available (Why is that?)
- A satisficing policy of the secretary problem: theory and simulation
- Secretaries with advice
- The secretary problem with predictions
- Secretary markets with local information
- The solution of a generalized secretary problem via analytic expressions
- Secretary Problems via Linear Programming
- Optimal online selection of an alternating subsequence: a central limit theorem
- Title not available (Why is that?)
- Improved competitive ratios for submodular secretary problems (extended abstract)
- On variants of the matroid secretary problem
- Selection and ordering policies for hiring pipelines via linear programming
- Dynamic programming and the secretary problem
- Primal-dual analysis for online interval scheduling problems
- Think eternally: improved algorithms for the temp secretary problem and extensions
This page was built for publication: Secretary Problems via Linear Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569816)
