Pages that link to "Item:Q5169698"
From MaRDI portal
The following pages link to Secretary Problems via Linear Programming (Q5169698):
Displaying 18 items.
- Dynamic programming and the secretary problem (Q918875) (← links)
- Avoiding patterns and making the best choice (Q1999721) (← links)
- Stable secretaries (Q1999964) (← links)
- The solution of a generalized secretary problem via analytic expressions (Q2012898) (← links)
- Strategy-indifferent games of best choice (Q2237240) (← links)
- New results for the \(k\)-secretary problem (Q2658048) (← links)
- The secretary problem with reservation costs (Q2695326) (← links)
- Improved algorithms and analysis for secretary problems and generalizations (Q2706186) (← links)
- Secretary Problems via Linear Programming (Q3569816) (← links)
- (Q4294400) (← links)
- Matroid Secretary Problems (Q4625656) (← links)
- Online Vertex-Weighted Bipartite Matching (Q4972684) (← links)
- Strong Algorithms for the Ordinal Matroid Secretary Problem (Q5000649) (← links)
- (Q5002758) (← links)
- Online Allocation and Pricing: Constant Regret via Bellman Inequalities (Q5003719) (← links)
- The Secretary Problem—An Update (Q5054129) (← links)
- Generalized Sequential Stochastic Assignment Problem (Q5113887) (← links)
- Algorithms for maximum social welfare of online random trading (Q6558686) (← links)