Erscheint 12 Ausgaben pro Jahr
ISSN Druckformat: 1064-2315
ISSN Online: 2163-9337
Indexed in
Iterative Method for Solving Combinatorial Optimization Problems of the Game-type on Arrangements
ABSTRAKT
A new class of problems the problems of combinatorial optimization of the game-type on arrangements is considered. In these problems, the strategies of one of the players are superimposed with combinatorial constraints. The iterative method for solving such problems is proposed. Numerical experiments have shown a quadratic dependence of computation time on the dimension of the problem and solution convergence.
-
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