Skip to main content
SpringerLink
Log in

On Complete and Quasi-Complete Two-Criteria Optimization Problems on Graphs

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

Sufficient conditions are studied for the presence of the completeness or quasicompleteness property in two-criteria discrete optimization problems with the same and different weight-type criteria. Estimates are computed for the cardinalities of sets of feasible solutions, the Pareto set, and a complete set of alternatives for a number of two-criteria problems.

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

Similar content being viewed by others

References

  1. V. Pareto, Manuel d’economic politique, Giard, Paris (1909).

    Google Scholar 

  2. Ch. A. Cooper and W. W. Cooper, Management Models and Industrial Applications of Lineal Programming, Vol. 1, Wiley, New York (1961).

    MATH  Google Scholar 

  3. V. A. Perepelitsa, Multicriteria Models and Methods for Optimization Problems on Graphs, LAP LAMBERT Acad. Publ., Saarbrücken (2013).

    Google Scholar 

  4. V. A. Perepelitsa, “A class of multicriterial problems on graphs and hypergraphs,” Cybernetics, Vol. 20, No. 4, 542–548 (1984).

    MATH  Google Scholar 

  5. V. A. Perepelitsa, “On the efficiency of using discrete optimization methods for the analysis of systems,” in: Proc. All-Union Conf. “Theory, methodology, and practice of system investigations,” VNIISI GKNT and AN of the USSR, Moscow (1984), pp. 198–200.

  6. V. A. Perepelitsa and N. K. Maksishko, “A multicriterion problem of covering a digraph by contours,” in: Proc. 3rd All-Union Conf. (Tashkent, August 28–30, 1984), Part 2, Comp. Center of SD of AS of the USSR, Novosibirsk (1984), pp. 97–98.

  7. I. V. Sergienko and V. A. Perepelitsa, “Finding the set of alternatives in discrete multicriterion problems,” Cybernetics, Vol. 23, No. 5, 673–683 (1987).

    Article  MATH  Google Scholar 

  8. V. A. Emelichev and V. A. Perepelitsa, “Complexity of Discrete Multicriterion Problems,” Discrete Mathematics, Vol. 6, Iss. 1, 3–33 (1994).

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Zaporizhzhya National University, Zaporizhzhya, Ukraine

    V. A. Perepelitsa

  2. Zaporizhzhya National Technical University, Zaporizhzhya, Ukraine

    E. V. Tereschenko

Authors
  1. V. A. Perepelitsa
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. E. V. Tereschenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to V. A. Perepelitsa.

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 3, May–June, 2018, pp. 51–57.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Perepelitsa, V.A., Tereschenko, E.V. On Complete and Quasi-Complete Two-Criteria Optimization Problems on Graphs. Cybern Syst Anal 54, 385–390 (2018). https://doi.org/10.1007/s10559-018-0040-1

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-018-0040-1

Keywords

Search

Navigation