Abstract
IN an establishment, there are v= nk officers, r departments and k types of jobs in each department. Each officer has to be assigned a job in each department such that in any department there are equal numbers of officers in different jobs and any two officers have common jobs in exactly λ departments.
Similar content being viewed by others
Article PDF
References
Yates, F., Ann. Eugen., 7, 121 (1936).
Stevens, W. L., Ann. Eugen., 9, 82 (1939).
Bose, R. C., Ann. Eugen., 9, 353 (1939).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
RAO, C. A Combinatorial Assignment Problem. Nature 191, 100 (1961). https://doi.org/10.1038/191100a0
Issue Date:
DOI: https://doi.org/10.1038/191100a0
Comments
By submitting a comment you agree to abide by our Terms and Community Guidelines. If you find something abusive or that does not comply with our terms or guidelines please flag it as inappropriate.