Generating combinatorial sets with given properties

DOI10.1007/S10559-012-9469-9MaRDI QIDQ2263238zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 4099308
• Mathematical Foundations of Computer Science 2003
• scientific article; zbMATH DE number 3917730
• A new algorithm for generating combinations
• An algorithm for generating subsets of fixed size with a strong minimal change property

Cites work

• scientific article; zbMATH DE number 1265079 (Why is no real title available?)
• scientific article; zbMATH DE number 2176112 (Why is no real title available?)
• A modification of the method of combinatorial truncation in optimization problems over vertex-located sets
• A polyhedral approach to solving multicriterion combinatorial optimization problems over sets of polyarrangements
• A problem of packing of homothetic convex polytopes
• Description and generation of permutations containing cycles
• Method of ordering the values of a linear function on a set of permutations
• Packing \(n\)-dimensional parallelepipeds with the feasibility of changing their orthogonal orientation in an \(n\)-dimensional parallelepiped

Cited in

(9)

• A note on combination generators
• Influence of certain transpositions on the cyclic structure of permutations
• Limiting the search in brute force method for subsets detection
• scientific article; zbMATH DE number 4099308 (Why is no real title available?)
• On the effective generation of set elements within specified ranges
• Theory and methods of Euclidian combinatorial optimization: current status and prospects
• A problem of packing of homothetic convex polytopes
• Generating all subsets of a finite set with disjoint unions
• Continuous representations and functional extensions in combinatorial optimization

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2263238)