Abstract
Special classes of combinatorial sets called k-sets are analyzed. An algorithm for the generation of k-sets is proposed. It is based on a unified algorithm for generating base combinatorial sets. The possibilities of using it to generate various base sets are considered. The complexity of the algorithms is assessed. The results of computational experiments are analyzed.
Article PDF
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
References
D. Knuth, The Art of Computer Programming, Vol. 4, Fascicle 2: Generating All Tuples and Permutations, Addison-Wesley, Boston (2005).
D. Knuth, The Art of Computer Programming, Vol. 4, Fascicle 3: Generating All Combinations and Partitions, Addison-Wesley, Boston (2005).
D. L. Kreher and D. R. Stinson, Combinatorial Algorithms: Generation Enumeration and Search, CRC Press (1999).
M. Bona, Combinatorics of Permutations, Chapman Hall-CRC, Boston (2004).
F. Ruskey, Combinatorial Generation, Dept. of Comput. Sci. Univ. of Victoria, Canada, 1j-CSC 425/20 (2003).
J. F. Korsh and P. S. LaFollette, “Loopless array generation of multiset permutations,” The Comput. J., 47, No. 5, 612–621 (2004).
N. V. Semenova and L. N. Kolechkina, “ A polyhedral approach to solving multicriterion combinatorial optimization problems over sets of polyarrangements:,” Cybern. Syst. Analysis, 45, No. 3, 438–445 (2009).
O. A. Yemets and Ye. M. Yemets, “A modification of the method of combinatorial truncation in optimization problems over vertex-located sets,” Cybern. Syst. Analysis, 45, No. 5, 785–791 (2009).
G. A. Donets and L. N. Kolechkina, “Method of ordering the values of a linear function on a set of permutations,” Cybern. Syst. Analysis, 45, No. 2, 204–213 (2009).
I. V. Grebennik, A. V. Pankratov, A. M. Chugay, and A. V. Baranov, “Packing n-dimensional parallelepipeds with the feasibility of changing their orthogonal orientation in an n-dimensional parallelepiped,” Cybern. Syst. Analysis, 46, No. 5, 793–802 (2010).
Yu. G. Stoyan and I. V. Grebennik, “Compositional images of combinatorial sets and some of their properties,” Problemy Mashinostr., 8, No. 3, 56–62 (2005).
Yu. G. Stoyan and I. V. Grebennik, “Describing classes of combinatorial configurations based on mappings,” Dop. NANU, No. 10, 28–31 (2008).
Yu. G. Stoyan and I. V. Grebennik, “Description and generation of combinatorial sets having special characteristics,” Intern. J. of Biomed. Soft Comput. and Human Sci., Spec. Vol. “Bilevel Programming, Optimization Methods, and Applications to Economics,” 18, No. 1, 85–90 (2011).
I. V. Grebennik, “Description and generation of permutations containing cycles,” Cybern. Syst. Analysis, 46, No. 6, 945–952 (2010).
W. Lipski, Combinatorics for Programmers [in Polish], Polish Sci. Publ. (PWN), Warsaw (1982).
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 6, November–December, 2012, pp. 96–105.
Rights and permissions
About this article
Cite this article
Grebennik, I.V., Lytvynenko, O.S. Generating combinatorial sets with given properties. Cybern Syst Anal 48, 890–898 (2012). https://doi.org/10.1007/s10559-012-9469-9
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10559-012-9469-9