Description and generation of permutations containing cycles
From MaRDI portal
Publication:2247815
DOI10.1007/s10559-010-9275-1zbMath1291.05002OpenAlexW2040436260MaRDI QIDQ2247815
Publication date: 30 June 2014
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-010-9275-1
cyclepermutationcyclic permutationcombinatorial speciescombinatorial generationmultiplication of cycles
Related Items (3)
Influence of certain transpositions on the cyclic structure of permutations ⋮ Theory and methods of Euclidian combinatorial optimization: current status and prospects ⋮ Generating combinatorial sets with given properties
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Features of formation and ordering of samples
- A problem of packing of homothetic convex polytopes
This page was built for publication: Description and generation of permutations containing cycles