Proving the convergence of the iterative method for solving a game-type combinatorial optimization problem on arrangements

DOI10.1007/s10559-013-9489-0zbMath1298.90086OpenAlexW2049966534MaRDI QIDQ465925

O. A. Iemetsa, E. V. Olkhovskaja

Publication date: 24 October 2014

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-013-9489-0

zbMATH Keywords

iterative methodconvergence of a methodEuclidean combinatorial optimizationgame-type combinatorial optimization problem

Mathematics Subject Classification ID

Applications of game theory (91A80) Combinatorial optimization (90C27)

Cites Work

• Combinatorial optimization model of packing rectangles with stochastic parameters
• Analysis of mathematical models and methods of solving combinatorial optimization problems on game-type permutations
• Games with combinatorial constraints
• Algorithmic solution of two parametric optimization problems of a set of complete combinations
• An iterative method of solving a game
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item