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 ...
The Journal of the Operational Research Society, Vol. 41, No. 4 (Apr., 1990), pp. 291-297 (7 pages) The Hitchcock transportation problem is perhaps one of the `most solved' linear programming problems ...
Integer linear programming can help find the answer to a variety of real-world problems. Now researchers have found a much faster way to do it. The traveling salesperson problem is one of the oldest ...
Marshall, Paul W. "Linear Programming: A Technique for Analyzing Resource Allocation Problems." Harvard Business School Background Note 171-322, January 1971. (Revised November 1975.) ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback