Skip to main content
SpringerLink
Log in

Features of Formation and Ordering of Samples

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

It is proved that combinatorial configurations formed by a recurrent combinatorial access statement (combinations with repetition and without repetition, permutation with repetition and without repetition, binary sequences, simple marked graphs) are generated by one and the same algorithm or by its modification.

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. N. K. Timofeeva, “Ordering a set of values of an objective function in combinatorial optimization,” Kibern. Sist. Analiz, No. 6, 78–87 (1998).

    Google Scholar 

  2. N. K. Timofeeva, “On some properties of partitioning a set into subsets,” UsiM, No. 5, 6–23 (2002).

    Google Scholar 

  3. K. A. Rybnikov, Introduction to the Combinatorial Analysis [in Russian], Izd. Mosk. Univ., Moscow (1985).

    Google Scholar 

  4. V. N. Sachkov, Combinatorial Methods in Discrete Mathematics [in Russian], Nauka, Moscow (1977).

    Google Scholar 

  5. E. Reingold, U. Nivergelt, and N. Deo, Combinatorial Algorithms. The Theory and Practice [Russian translation], Mir, Moscow (1980).

    Google Scholar 

  6. V. Lipskii, The Theory of Combinations for Programmers [Russian translation], Mir, Moscow (1988).

    Google Scholar 

  7. Yu. V. Korzhenevich, Combinatorial Problems: Olympiads in Programming [in Russian], Universitetskoye, Minsk (1989).

    Google Scholar 

  8. N. V. Bilous, Z. V. Dudar, N. S. Lesna, and I. Yu. Shutin, Fundamentals of Combinatorial Analysis [in Ukrainian], KhDTURE, Kharkiv (1999).

    Google Scholar 

  9. M. H. Hall, The Theory of Combinations [Russian translation], Mir, Moscow (1970).

    Google Scholar 

  10. R. Stanley, The Enumerative Theory of Combinations [Russian translation], Mir, Moscow (1990).

    Google Scholar 

  11. V. V. Riznyk, “Analysis of combinatorial configurations and their application in synthesis of technical devices for systems with a nonequidistant structure,” Author's PhD Thesis, Vinnytsk. Derzh. Tekhn. Univ., Vinnytsya (1994).

    Google Scholar 

  12. M. Igner, The Combinatorial Theory [Russian translation], Mir, Moscow (1982).

    Google Scholar 

  13. P. Franke and N. Tokuskige, “Some inequalities concerning cross-intersecting families,” Comb. Probab. Comput., 7, No. 3, 247– 260 (1998).

    Google Scholar 

  14. S. V. Yakovlev and I. V. Grebennik, “Properties of the Euclidean combinatorial sets of permutations with and without repetitions,” Probl. Bioniki, No. 42, 90–95 (1989).

    Google Scholar 

  15. N. K. Timofeeva, “Methods of constructing argument of objective function in combinatorial optimization problems,” Kibern. Sist. Analiz, No. 6, 96–103 (2002).

    Google Scholar 

  16. Z. M. Asel'derov and G. A. Donets, Representation and Restoring of Graphs [in Russian], Naukova Dumka, Kiev (1991).

    Google Scholar 

  17. I. I. Melamed, I. Kh. Sigal, and N. Yu. Vladimirova, “Analysis of linear convolution of criteria in the bicriterion knapsack problem,” Zh. Vych. Mat. Mat. Fiz., 39, No. 5, 753–758 (1999).

    Google Scholar 

  18. Yu. G. Stoyan and O. O. Emets', Theory and Methods of the Euclidean Combinatorial Optimization [in Ukrainian], Minosvity Ukr., Kiev (1993).

    Google Scholar 

  19. O. A. Emets' and A. A. Roskladka, “Algorithmic solution of two parametric optimization problems on a set of complete combinations,” Kibern. Sist. Analiz, No. 6, 160–165 (1999).

    Google Scholar 

  20. O. S. Pichugina, “Methods and algorithms of solving some optimization problems on sets of combinations of permulations,” Author's PhD Thesis, Inst. Probl. Mashinobud., Kharkiv (1996).

    Google Scholar 

  21. Lin Edward Yu-Hsien, “A bibliographical survey on some well-known non-standard knapsack problems,” INFOR, 36, No. 4, 274–317 (1998).

    Google Scholar 

  22. O. O. Emets' and A. A. Roskladka, “On estimates of minima of objective functions in optimization on combinations,” Ukr. Mat. Zh., 51, No. 8, 1118–1121 (1999).

    Google Scholar 

  23. O. A. Emets, O. I. Nedobachii, and L. N. Kolechkina, “A nonreducible system of constraints of a combinatorial polyhedron in a linear-fractional optimization problem on permutations,” Diskr. Mat., 13, Issue 1, 110–118 (2001).

    Google Scholar 

  24. T. K. Vintsyuk, Analysis, Recognition, and Interpretation of Speech Signals [in Russian], Naukova Dumka, Kiev (1987).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. UNESCO International Scientific and Training Center of Information Technologies and Systems, National Academy of Sciences of Ukraine and Ministry of Education and Science of Ukraine, Kiev, Ukraine

    N. K. Timofeeva

Authors
  1. N. K. Timofeeva
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Timofeeva, N.K. Features of Formation and Ordering of Samples. Cybernetics and Systems Analysis 40, 460–466 (2004). https://doi.org/10.1023/B:CASA.0000042004.85948.6b

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:CASA.0000042004.85948.6b

Search

Navigation