This is a preview of subscription content, log in via an institution to check access.
Literature Cited
V. S. Mikhalevich, I. V. Sergienko, T. T. Lebedeva, et al., “DISPRO software package for solution of problems of discrete programming,” Kibernetika, No. 3, 117–137 (1981).
V. I. Artemenko and I. V. Sergienko, “P-method of solution of integer linear programming problems with Boolean variables,” Dokl. Akad. Nauk UkrSSR, Ser. A, No. 4, 72–75 (1980).
I. V. Sergienko, “N-method of solution of optimization problems of partially integer programming,” Kibernetika, No. 1, 75–78 (1981).
I. V. Sergienko, T. T. Lebedeva, and V. A. Roshchin, Approximate Methods of Solution of Discrete Optimization Problems [in Russian], Naukova Dumka, Kiev (1980).
V. L. Volkovich and A. F. Voloshin, “A general scheme of sequential analysis and screening out,” Kibernetika, No. 5, 98–105 (1978).
É. Balas, “Additive algorithm for solution of linear programming problems with variables assuming the value 0 or 1,” Kibern. Sb., No. 6, 217–252 (1969).
Yu. Yu. Chervak and V. I. Grendzha, Lexicographic Search for Solution of Multidimensional Backpack Problems with Boolean Variables [in Russian], Uzhgorod University Mathematics Department, Uzhgorod (1982). (Manuscript deposited with VINITI, 10/06/82, No. 4640-82).
Yu. Yu. Chervak, “Recurrent algorithm with truncation method and branch-and-bound method,” Ekon. Mat. Metody,14, No. 5, 1002–1005 (1978).
V. A. Roshchin, I. V. Sergienko, and N. V. Semenova, “Solution of partially integer optimization problems convex with respect to continuous variables,” Kibernetika, No 5, 62–66 (1981).
V. A. Trubin, M. M. Gil'burd, V. N. Deryugin, et al., Theoretic and Experimental Study of Combinatorial Problems [in Russian], IK Akad. Nauk UkrSSR (Preprint 84-14), Kiev (1984).
V. S. Mikhalevich (ed.), Computational Methods for the Choice of Optimum Design Concepts [in Russian], Naukova Dumka, Kiev (1977).
V. A. Trubin and B. M. Chumakov, “Unification and placement of technological facilities,” in: Theory of Optimum Decisions [in Russian], IK Akad. Nauk UkrSSR, Kiev (1979), pp. 69–75.
E. Mainika, Optimization Algorithm on Grids and Graphs [Russian translation], Mir, Moscow (1981).
M. Gary and D. S. Johnson, Computers and Difficult Problems [Russian translation], Mir, Moscow (1982).
V. A. Trubin, “Algorithm for solution of the Steiner problem on graphs,” in: Models and Algorithms for Solution of Planning and Management Problems [in Russian], Shtiintsa, Kishinev (1982), pp. 151–157.
T. C. Hu, Integer Programming and Network Flows, Addison-Wesley (1969).
N. Kristofides, Graph Theory: Algorithmic Approach [Russian translation], Mir, Moscow (1978).
B. G. Mirkin, Analysis of Qualitative Features and Structures [in Russian], Statistika, Moscow (1980).
B. Durand and P. Odell, Cluster Analysis [in Russian], Statistika, Moscow (1977).
W. Koontz, “A branch-and-bound clustering algorithm,” IEEE Trans. Comput.,24, No. 9, 908–915 (1975).
B. E. Burkard and U. Derigs, “Assignment and matching problems: solution methods with FORTRAN programs,” in: Lecture Notes in Economics and Math Systems (1980).
J. Edmonds and E. Johnson, “Matching, Euler tours and the Chinese postman,” Math. Programming,5, No. 1, 88–124 (1973).
I. V. Sergienko, A. S. Stukalo, N. S. Podgorodetskii, et al., Software for Transportation Problems: Control Program and Package Operation [in Russian], IK Akad. Nauk UkrSSR (Preprint 81-37), Kiev (1981).
V. S. Mikhalevich, I. V. Sergienko, V. A. Trubin, et al., “Software for production-transportation problems in planning of large-scale operations (Planer),” Kibernetika, No. 3, 57–71 (1983).
Additional information
Translated from Kibernetika, No. 1, pp. 56–71, January–February, 1985.
Rights and permissions
About this article
Cite this article
Mikhalevich, V.S., Sergienko, I.V., Shor, N.Z. et al. The software package DISPRO-3: Objectives, classes of problems, systemic and algorithmic support. Cybern Syst Anal 21, 68–86 (1985). https://doi.org/10.1007/BF01075121
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01075121