Notes on a Combinatorial Problem of B. O. Koopman
Peter D. Finch · Journal of the Operational Research Society · 1958
AT the recent International Conference on Operational Research, B. 0. Koopman' posed an interesting class of problems in the Combinatorial Analysis of Operations. Koopman defined the class of problem and then considered a simple example of that class, obtaining rough upper and lower limits to the numerical quantity required. In these notes I consider this simple example and obtain limits which are closer than those obtained by Koopman. Lastly, I consider the class of problems to which the approximate methods given here may be extended.