Доступ предоставлен для: Guest
Journal of Automation and Information Sciences

Выходит 12 номеров в год

ISSN Печать: 1064-2315

ISSN Онлайн: 2163-9337

SJR: 0.173 SNIP: 0.588 CiteScore™:: 2

Indexed in

Iterative Method for Solving Combinatorial Optimization Problems of the Game-type on Arrangements

Том 43, Выпуск 5, 2011, pp. 52-63
DOI: 10.1615/JAutomatInfScien.v43.i5.50
Get accessGet access

Краткое описание

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.

ЦИТИРОВАНО В
  1. 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

  2. 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

Портал Begell Электронная Бибилиотека e-Книги Журналы Справочники и Сборники статей Коллекции Цены и условия подписки Begell House Контакты Language English 中文 Русский Português German French Spain