This is a preview of subscription content, log in via an institution to check access.
References
V. A. Emelichev, M. M. Kovalev, and M. K. Kravtsov, Polyhedra, Graphs, and Optimization [in Russian], Nauka, Moscow (1981).
V. A. Roshchin and I. V. Sergienko, "An approach to the solution of the covering problem," Kibernetika, No. 6, 65–69 (1984).
V. A. Roshchin and I. V. Sergienko, "An algorithm for exact solution of the set partition problem," Dokl. Akad. Nauk UkrSSR, Ser. A, No. 1, 61–64 (1986).
V. A. Roshchin and I. V. Sergienko, "A method for solving the partial covering problem," Kibernetika, No. 1, 96–98 (1989).
V. A. Trubin and Yu. V. Voitishin, "An algorithm to solve the set partition problem," Kibernetika, No. 2, 136 (1981).
V. S. Mikhalevich, I. V. Sergienko, A. I. Kuksa, V. A. Roshchin, and V. A. Trubin, Results of an Experimental Study of the Efficiency of Methods Included in the DISPRO Software Package [in Russian], preprint No. 80-47, Inst. Kibern. Akad. Nauk UkrSSR, Kiev (1980).
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 19–22, November–December, 1993.
Rights and permissions
About this article
Cite this article
Roshchin, V.A., Sergienko, I.V. Application of implicit enumeration to solve the packing problem. Cybern Syst Anal 29, 795–797 (1993). https://doi.org/10.1007/BF01122731
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01122731