Skip to main content
SpringerLink
Log in

Method of ordering the values of a linear function on a set of permutations

  • Systems Analysis
  • Published:
Cybernetics and Systems Analysis Aims and scope

The paper deals with a new method of solving a combinatorial problem with account for the properties of the set of permutations and its structure. Using this method, the values of the linear objective function are sequenced and the set of permutations is decomposed over hyperplanes, with account of element recurrences. This makes it possible to develop an algorithm of finding the point (an element of the set of permutations) at which the objective function attains a given value.

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 M. F. Kaspshitskaya, Models and Methods of Solving Combinatorial Optimization Problems on a Computer [in Russian], Naukova Dumka, Kyiv (1981).

    Google Scholar 

  2. I. V. Sergienko, Mathematical Models and Methods of Solving Discrete Optimization Problems [in Russian], Naukova Dumka, Kyiv (1988).

    Google Scholar 

  3. N. V. Semenova, L. N. Kolechkina, and A. N. Nagornaya, “An approach to solving discrete vector optimization problems over a combinatorial set of permutations,” Cybern. Syst. Analysis, 44, No. 3, 441–451 (2008).

    Article  MATH  MathSciNet  Google Scholar 

  4. Yu. G. Stoyan and S. V. Yakovlev, Mathematical Models and Optimization Methods of Geometric Projection [in Russian], Naukova Dumka, Kyiv (1986).

    Google Scholar 

  5. Yu. G. Stoyan and O. O. Yemets’, Theory and Methods of Euclidean Combinatorial Optimization [in Ukrainian], Inst. System. Doslidzh. Osvity, Kyiv (1993).

    Google Scholar 

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

    Google Scholar 

  7. W. Lipski, Combinatorics for Programmers [in Polish], Polish Sci. Publ. (PWN), Warsaw (1982).

    Google Scholar 

  8. G. H. Hardy, J. E. Littlewood, and G. Polya, Inequalities, Cambridge Univ. Press, Cambridge (1934).

    Google Scholar 

  9. V. A. Emelichev, M. M. Kovalev, and M. K. Kravtsov, Polyhedra, Graphs, Optimization [in Russian], Nauka, Moscow (1981).

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    G. A. Donetsa & L. N. Kolechkina

Authors
  1. G. A. Donetsa
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. L. N. Kolechkina
    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. 50–61, March–April 2009.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Donetsa, G.A., Kolechkina, L.N. Method of ordering the values of a linear function on a set of permutations. Cybern Syst Anal 45, 204–213 (2009). https://doi.org/10.1007/s10559-009-9092-6

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-009-9092-6

Keywords

Search

Navigation