Skip to main content
SpringerLink
Log in

Multicriteria combinatorial optimization problems on a set of polypermutations

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

The studies on multicriteria combinatorial optimization are continued. A possible approach to solving multicriterion problems is developed and substantiated. An algorithm is developed and implemented. Some peculiarities of efficient solutions to multicriterion problems are described.

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. I. V. Sergienko and V. P. Shilo, Discrete Optimization Problems: Challenges, Solution Techniques, Analysis [in Russian], Naukova Dumka, Kyiv (2003).

    Google Scholar 

  2. Yu. P. Zaichenko, Operations Research. Fuzzy Optimization: A Textbook [in Russian], Vyshcha Shkola, Kyiv (1991).

    Google Scholar 

  3. O. O. Yemets and L. M. Kolechkina, Combinatorial Optimization Problems with Fractional-Linear Objective Functions [in Ukrainian], Naukova Dumka, Kyiv (2005).

    Google Scholar 

  4. Yu. G. Stoyan and O. O. Yemets, Theory and Methods of Euclidean Combinatorial Optimization [in Ukrainian], Kyiv (1993).

  5. V. V. Podinovskii and V. D. Nogin, Pareto-Optimal Solutions to Multicriterion Problems [in Russian], Nauka, Moscow (1982).

    Google Scholar 

  6. I. V. Sergienko, L. N. Kozeratskaya, and T. T. Lebedeva, Stability and Parametric Analyses of Discrete Optimization Problems [in Russian], Naukova Dumka, Kyiv (1995).

    Google Scholar 

  7. T. T. Lebedeva, N. V. Semenova, and T. I. Sergienko, “Stability of vector problems of integer optimization: Relationship with the stability of sets of optimal and nonoptimal solutions,” Cybern. Syst. Analysis, 41, No. 4, 551–558 (2005).

    Article  MATH  MathSciNet  Google Scholar 

  8. Yu. G. Stoyan, O. O. Yemets, and E. M. Yemets, Optimization on Polypermutations: Theory and Methods [in Ukrainian], RVTs PUSKU, Poltava (2005).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. V. M. Glushkov Institute of Cybernetics, National Academy of Sciences of Ukraine, Kyiv, Ukraine

    L. N. Kolechkina

  2. Poltava Institute of Business, Poltava, Ukraine

    E. A. Rodionova

Authors
  1. L. N. Kolechkina
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. E. A. Rodionova
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to L. N. Kolechkina.

Additional information

__________

Translated from Kibernetika i Sistemnyi Analiz, No. 2, pp. 152–160, March–April 2008.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kolechkina, L.N., Rodionova, E.A. Multicriteria combinatorial optimization problems on a set of polypermutations. Cybern Syst Anal 44, 276–282 (2008). https://doi.org/10.1007/s10559-008-0027-4

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-008-0027-4

Keywords

Search

Navigation