This is a preview of subscription content, log in via an institution to check access.
Literature Cited
A. G. Wilson, Entropy in Urban and Regional Modeling, Academic Press (1970).
I. V. Romanovskii and N. P. Khristova, “Solution of discrete problems by the dichotomy method,” Zh. Vychisl. Mat. Mat. Fiz.,13, No. 5, 1200–1209 (1973).
V. V. Shkurba and S. A. Beletskii, “Numerical methods for solving the assembly-line balancing problem,” Kibernetika, No. 1, 96–108 (1977).
S. B. Katsev, “On a class of discrete minimax problems,” Kibernetika, No. 5, 139–141 (1979).
M. Marcus and H. Minc, A Survey of Matrix Theory and Matrix Inequalities [Russian translation], Nauka, Moscow (1972).
E. G. Gol'shtein and D. B. Yudin, New Trends in Linear Programming [in Russian], Sovetskoe Radio, Moscow (1966).
L. R. Ford, Jr., and D. R. Fulkerson, Flows in Networks, Princeton University Press (1972).
Additional information
Translated from Kibernetika, No. 2, pp. 10–13, March–April, 1984.
Rights and permissions
About this article
Cite this article
Kordonskii, K.B., Khoikhin, E.B. An entropy estimate for the problem of location of ones in a binary matrix. Cybern Syst Anal 20, 179–184 (1984). https://doi.org/10.1007/BF01069172
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01069172