This is a preview of subscription content, log in via an institution to check access.
Literature Cited
I. V. Sergienko and V. N. Bykov, “Method of solving the generalized knapsack problem using parallel computations,” Dokl. Akad. Nauk Ukr. SSR, Ser. A, No. 7, 84–87 (1980).
I. V. Sergienko and L. F. Gulyanitskii, “Frontal algorithm for multiprocessor computers,” Kibernetika, No. 6, 1–4 (1981).
Yu. Yu. Chervak, Lexicographic Search for the Solutions of Discrete Programming Problems [in Russian], Izd. Uzhgorodsk. Univ., Uzhgorod (1977).
Yu. Yu. Chervak and V. I. Grendzha, “Lexicographic search for a solution of the multivariate knapsack problems with Boolean variables,” in: Proc. Thirty-Fifth Summary Scientific Conference of Uzhgorod State University [in Russian] (1982), pp. 127–140 (manuscript deposited at the All-Union Institute of Scientific and Technical Information, August 23, 1982, No. 46-40-82).
C. C. Petersen, “Computational experience with variants of the Balas algorithm applied to the selection of R&D projects,” Manag. Sci.,13, No. 9, 736–750 (1967).
Additional information
Translated from Kibernetika, No. 5, pp. 82–85, September–October, 1984.
Rights and permissions
About this article
Cite this article
Sergienko, I.V., Chervak, Y.Y. & Grendzha, V.I. Parallelization in lexicographic discrete optimization algorithms. Cybern Syst Anal 20, 720–725 (1984). https://doi.org/10.1007/BF01071618
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01071618