A polyhedral approach to solving multicriterion combinatorial optimization problems over sets of polyarrangements

Abstract

Multicriterion discrete optimization problems over feasible combinatorial sets of polyarrangements are considered. Structural properties of feasible domains and different types of efficient solutions are investigated. Based on the ideas of Euclidean combinatorial optimization and the major criterion method, a polyhedral approach to the solution of the problems is developed and substantiated.

Description and generation of permutations containing cycles

“…Generation of rather simple objects such as permutations, combinations, partitions, trees, binary sequences, are mainly considered in the literature. The results of the solution of generation problems are used in modeling, combinatorial optimization, and other fields [7][8][9][10]. Generating more complex combinatorial objects is difficult because there are no constructive means, and much computational efforts are required since the results of application of well-known generation means are redundant.…”