Generating combinatorial sets with given properties

DOI10.1007/s10559-012-9469-9zbMath1308.05002OpenAlexW2000636547MaRDI QIDQ2263238

I. V. Grebennik, O. S. Lytvynenko

Publication date: 18 March 2015

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-012-9469-9

zbMATH Keywords

generationcombinatorial setbase set

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial optimization (90C27)

Related Items (3)

Influence of certain transpositions on the cyclic structure of permutations ⋮ Theory and methods of Euclidian combinatorial optimization: current status and prospects ⋮ Continuous representations and functional extensions in combinatorial optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Packing \(n\)-dimensional parallelepipeds with the feasibility of changing their orthogonal orientation in an \(n\)-dimensional parallelepiped
• A modification of the method of combinatorial truncation in optimization problems over vertex-located sets
• Method of ordering the values of a linear function on a set of permutations
• A polyhedral approach to solving multicriterion combinatorial optimization problems over sets of polyarrangements
• Description and generation of permutations containing cycles
• A problem of packing of homothetic convex polytopes

This page was built for publication: Generating combinatorial sets with given properties