In the classical secretary problem an employer would like to choose the best candidate among n competing candidates that arrive in a random order. In each iteration, one candidate's rank vis-a-vis ...
https://doi.org/10.2307/2583200 • https://www.jstor.org/stable/2583200 Copy URL A linear programming problem is presented to solve a problem in determining how many ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback