Application of implicit enumeration to solve the packing problem
Cybernetics
Received:
- 21 Downloads
Keywords
Operating System Artificial Intelligence System Theory Packing Problem Implicit Enumeration
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
- 1.V. A. Emelichev, M. M. Kovalev, and M. K. Kravtsov, Polyhedra, Graphs, and Optimization [in Russian], Nauka, Moscow (1981).Google Scholar
- 2.V. A. Roshchin and I. V. Sergienko, "An approach to the solution of the covering problem," Kibernetika, No. 6, 65–69 (1984).Google Scholar
- 3.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).Google Scholar
- 4.V. A. Roshchin and I. V. Sergienko, "A method for solving the partial covering problem," Kibernetika, No. 1, 96–98 (1989).Google Scholar
- 5.V. A. Trubin and Yu. V. Voitishin, "An algorithm to solve the set partition problem," Kibernetika, No. 2, 136 (1981).Google Scholar
- 6.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).Google Scholar
Copyright information
© Plenum Publishing Corporation 1994