年間 12 号発行
ISSN 印刷: 1064-2315
ISSN オンライン: 2163-9337
Indexed in
Studies of Problems of Combinatorial Optimization of Game Type on Arrangements
要約
We construct and investigate mathematical models of optimization problems on arrangements of game type, for which one player has combinatorial restrictions for use of his strategies. For problems of 2 × n and m × 2 dimension modified graphical method is suggested. Theorems of equivalence of each model to two optimization problems are proved and methods of their solution are suggested.
-
Iemetsa O. A., Olkhovskaja E. V., Proving the convergence of the iterative method for solving a game-type combinatorial optimization problem on arrangements, Cybernetics and Systems Analysis, 49, 1, 2013. Crossref
-
Iemets O. Ol., Yemets’ O. Ol., Polyakov I. M., Criterion of an Edge of a General Polyhedron of Arrangements, Cybernetics and Systems Analysis, 54, 5, 2018. Crossref