Skip to main content
SpringerLink
Log in

A class of multicriterial problems on graphs and hypergraphs

  • Published:
Cybernetics Aims and scope

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Literature Cited

  1. V. A. Selyutin, Machine Design of Electronic Devices [in Russian], Sovet-skoe Radio, Moscow (1977).

    Google Scholar 

  2. A. N. Melikhov and L. S. Bershtein, Hypergraphs in Computer-Aided Design of Digital Devices [in Russian], Rostov. Univ., Rostov (1981).

    Google Scholar 

  3. A. I. Petrenko, Fundamentals of Computer-Aided Design [in Russian], Tekhnika, Kiev (1982).

    Google Scholar 

  4. N. N. Moiseev, Mathematical Problems of System Analysis [in Russian], Nauka, Moscow (1981).

    Google Scholar 

  5. V. M. Glushkov, “On system optimization,” Kibernetika, No. 5, 89–90 (1980).

    Google Scholar 

  6. V. V. Podinovskii and V. D. Nogin, Pareto-Optimal Solutions of Multicriterial Problems [in Russian], Nauka, Moscow (1982).

    Google Scholar 

  7. M. Gary and D. Johnson, Computers and Hard Problems [Russian translation], Mir, Moscow (1982).

    Google Scholar 

  8. É. Kh. Gimadi, N. I. Glebov, and V. A. Perepelitsa, “Algorithms with bounds for discrete optimization problems,” Probl. Kibern., No. 31, 35–42 (1975).

    Google Scholar 

  9. M. F. Kazakova, “Finding Pareto optima in the polymatrix traveling salesman problem,” Mat. Metody Reshen. Ekonom. Zadach, No. 5, 55–61 (1974).

    Google Scholar 

  10. V. O. Serpinskii, Integer Solutions of Equations [in Russian], Fizmatgiz, Moscow (1961).

    Google Scholar 

  11. M. Hall, Combinatorial Theory, Wiley (1975).

  12. V. A. Perepelitsa, “An asymptotic approach to the solution of some extremal problems on graphs,” Probl. Kibern., No. 26, 291–314 (1973).

    Google Scholar 

  13. 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.

    Google Scholar 

  14. J. E. Hopcroft and R. M. Karp, “An n5/2 algorithm for maximum matching in bipartite graphs,” SIAM J. Comput.,2, 225–231 (1973).

    Google Scholar 

  15. J. Hartmanis and J. E. Hopcroft, “A review of the theory of computational complexity,” Kibern. Sbornik (new series), No. 11, 131–176 (1974).

    Google Scholar 

  16. 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.

  17. I. V. Sergienko and M. F. Kaspshitskaya, Models and Methods for Computer Solution of Combinatorial Optimization Problems [in Russian], Naukova Dumka, Kiev (1981).

    Google Scholar 

  18. 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).

    Google Scholar 

  19. V. M. Glushkov, “On a conversational method for the solution of optimization problems,” Kibernetika, No. 4, 2–6 (1975).

    Google Scholar 

Download references

Authors
  1. V. A. Perepelitsa
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 4, pp. 62–67, July–August, 1984.

Rights and permissions

Reprints and permissions

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

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01068929

Keywords

Search

Navigation