Generating combinatorial sets with given properties
From MaRDI portal
Recommendations
Cites work
- 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
- scientific article; zbMATH DE number 1265079 (Why is no real title available?)
- scientific article; zbMATH DE number 2176112 (Why is no real title available?)
- 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)- Theory and methods of Euclidian combinatorial optimization: current status and prospects
- Influence of certain transpositions on the cyclic structure of permutations
- On the effective generation of set elements within specified ranges
- A problem of packing of homothetic convex polytopes
- scientific article; zbMATH DE number 4099308 (Why is no real title available?)
- Continuous representations and functional extensions in combinatorial optimization
- A note on combination generators
- Generating all subsets of a finite set with disjoint unions
- Limiting the search in brute force method for subsets detection
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)