This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
V. A. Selyutin, Machine Design of Electronic Devices [in Russian], Sovet-skoe Radio, Moscow (1977).
A. N. Melikhov and L. S. Bershtein, Hypergraphs in Computer-Aided Design of Digital Devices [in Russian], Rostov. Univ., Rostov (1981).
A. I. Petrenko, Fundamentals of Computer-Aided Design [in Russian], Tekhnika, Kiev (1982).
N. N. Moiseev, Mathematical Problems of System Analysis [in Russian], Nauka, Moscow (1981).
V. M. Glushkov, “On system optimization,” Kibernetika, No. 5, 89–90 (1980).
V. V. Podinovskii and V. D. Nogin, Pareto-Optimal Solutions of Multicriterial Problems [in Russian], Nauka, Moscow (1982).
M. Gary and D. Johnson, Computers and Hard Problems [Russian translation], Mir, Moscow (1982).
É. Kh. Gimadi, N. I. Glebov, and V. A. Perepelitsa, “Algorithms with bounds for discrete optimization problems,” Probl. Kibern., No. 31, 35–42 (1975).
M. F. Kazakova, “Finding Pareto optima in the polymatrix traveling salesman problem,” Mat. Metody Reshen. Ekonom. Zadach, No. 5, 55–61 (1974).
V. O. Serpinskii, Integer Solutions of Equations [in Russian], Fizmatgiz, Moscow (1961).
M. Hall, Combinatorial Theory, Wiley (1975).
V. A. Perepelitsa, “An asymptotic approach to the solution of some extremal problems on graphs,” Probl. Kibern., No. 26, 291–314 (1973).
V. A. Perepelitsa, “On the assignment problem,” in: Controllable Systems [in Russian], No. 2, Inst. Mat., Inst. Kibern., Akad. Nauk SSSR, Novosibirsk (1973), pp. 45–48.
J. E. Hopcroft and R. M. Karp, “An n5/2 algorithm for maximum matching in bipartite graphs,” SIAM J. Comput.,2, 225–231 (1973).
J. Hartmanis and J. E. Hopcroft, “A review of the theory of computational complexity,” Kibern. Sbornik (new series), No. 11, 131–176 (1974).
V. G. Marsal'skii, V. A. Perepelitsa, and S. A. Petrov, “A multicriterial formulation of the component assembly problem in electronic-industry CAD systems,” in: Management Information Systems [in Russian], No. 2, KhAI, Khar'kov (1979), pp. 22–23.
I. V. Sergienko and M. F. Kaspshitskaya, Models and Methods for Computer Solution of Combinatorial Optimization Problems [in Russian], Naukova Dumka, Kiev (1981).
V. S. Mikhalevich, I. V. Sergienko, T. T. Lebedeva, V. A. Roshchin, A. S. Stukalo, V. A. Trubin, and N. Z. Shor, “The DISPRO application package for the solution of discrete programming problems,” Kibernetika, No. 3, 117–137 (1981).
V. M. Glushkov, “On a conversational method for the solution of optimization problems,” Kibernetika, No. 4, 2–6 (1975).
Translated from Kibernetika, No. 4, pp. 62–67, July–August, 1984.
About this article
Cite this article
Perepelitsa, V.A. A class of multicriterial problems on graphs and hypergraphs. Cybern Syst Anal 20, 542–548 (1984). https://doi.org/10.1007/BF01068929
- Operating System
- Artificial Intelligence
- System Theory
- Multicriterial Problem