Abonnement à la biblothèque: Guest
Journal of Automation and Information Sciences

Publication de 12  numéros par an

ISSN Imprimer: 1064-2315

ISSN En ligne: 2163-9337

SJR: 0.173 SNIP: 0.588 CiteScore™:: 2

Indexed in

Studies of Problems of Combinatorial Optimization of Game Type on Arrangements

Volume 39, Numéro 1, 2007, pp. 24-35
DOI: 10.1615/J Automat Inf Scien.v39.i1.30
Get accessGet access

RÉSUMÉ

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.

CITÉ PAR
  1. 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

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

Portail numérique Bibliothèque numérique eBooks Revues Références et comptes rendus Collections Prix et politiques d'abonnement Begell House Contactez-nous Language English 中文 Русский Português German French Spain