Abstract
The model of the problem of conditional optimization on the set of partial permutations is formulated. The linear form of the objective function is obtained by interpreting the elements of the set of partial permutations as points of the Euclidean space. A combinatorial polytope of allocations is considered for which there is a graph of the set of partial permutations An algorithm for solving this problem is proposed and its practical applicability is demonstrated. The proposed algorithm for solving the conditional optimization problem provides for the representation of the admissible of the Set of Partial Permutations in the form of a graph, which significantly reduces the search path for the optimal solution, as evidenced by the practical example considered.
Publisher
National Academy of Sciences of Ukraine (Co. LTD Ukrinformnauka)
Reference17 articles.
1. 1. Sergienko, I.V., Shilo, V.P., 2003. Discrete Optimization Problems: Challenges, Analysis Tech-niques, and Solution, Naukova Dumka, Kyiv. 261 p. (in Russian).
2. 2. Bernhard, K., Jens, V., 2012. Combinatorial Optimization, Theory and Algorithms. Springer-Verlag, Berlin, 627 p.
3. 3. Colbourn, C.J., Dinitz, J.H., 2010. Handbook of Combinatorial Designs, Second Edition. CRC Press, 784 p.
4. 4. Korte, B., Vygen, J., 2018. Combinatorial Optimization: theory and algorithms. Heidelberg; New York : Springer, 698 p.
5. 5. Pardalos, P.M., D-Z. Du, Graham, R.L., 2013. Handbook of combinatorial optimization. New York : Springer, 3409 p.