Secretary Problems via Linear Programming
From MaRDI portal
Publication:3569816
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
(14)- Dynamic programming and the secretary problem
- Selection and ordering policies for hiring pipelines via linear programming
- Think eternally: improved algorithms for the temp secretary problem and extensions
- Optimal online selection of an alternating subsequence: a central limit theorem
- scientific article; zbMATH DE number 572375 (Why is no real title available?)
- Secretaries with advice
- The secretary problem with predictions
- Secretary Problems via Linear Programming
- scientific article; zbMATH DE number 4003908 (Why is no real title available?)
- Improved competitive ratios for submodular secretary problems (extended abstract)
- Secretary markets with local information
- The solution of a generalized secretary problem via analytic expressions
- A satisficing policy of the secretary problem: theory and simulation
- Primal-dual analysis for online interval scheduling problems
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)