A monotone iterative method for solving the combinatorial game-type optimization problems on permutations
DOI:
https://doi.org/10.15407/dopovidi2014.08.048Keywords:
combinatorial optimization problems, monotone iterative methodAbstract
A monotone iterative method of searching for the game price for solving the combinatorial game-type optimization problems on permutations with restrictions on the strategy of one player is proposed. The monotonous iterative method allows one to quickly get the price value for a game with the specified accuracy and the optimal strategy for the first player. Moreover, the number of steps of the method weakly depends on the dimension of the problem.
Downloads
References
Emets O. A., Ustian N. Yu. Kibernetika i sist. analiz, 2007, No 6: 103–114 (in Russian).
Emets O. A., Ustian N. Yu. Nauk. visti NTUU “KPI”, 2007, No 3: 47–52 (in Ukrainian).
Emets O. A., Ustian N. Yu. Nauk. visti NTUU “KPI”, 2008, No 3: 5–10 (in Ukrainian).
Emets O. A., Olkhovskaya E. V. Probl. upravleniia i informatiki, 2011, No 3: 69–78 (in Russian).
Sadovskiy A. L. Dokl. AN USSR, 1978, 238, No 3: 538–540 (in Russian).
Stoian Yu. G., Emets O. O. Theory and methods of Euclidean combinatorial optimization, Kyiv: Int-t systemn. doslidzhen osvity, 1993 (in Ukrainian).
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2025 Reports of the National Academy of Sciences of Ukraine
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
