Published 12 issues per year
ISSN Print: 1064-2315
ISSN Online: 2163-9337
Indexed in
Solving of Some Problems of Combinatorial Optimization on Arrangements and Permutations of Game Type
ABSTRACT
We construct and investigate mathematical models of optimization problems on arrangements and permutations of game type, for which both players have combinatorial restrictions for use of their strategies. For problems of 2 × n and 2 × m dimension modified graphical method is suggested.
-
Iemetsa O. O., Yemetsa O. O., Solving a linear problem of Euclidean combinatorial optimization on arrangements with the constant sum of the elements, Cybernetics and Systems Analysis, 48, 4, 2012. Crossref
-
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