Shopping cart ITEMS
 modern scholarly publishers in the finest tradition
Login Register
Home
Books
Journals
References
A-Z Index
Author Index
For Our Authors
User Area
Shopping Cart
Contact
Electronic Data Center

Journal of Automation and Information Sciences

 

ISSN for PRINT: 1064-2315

Institutional price:

$2573.00

Issues per year:

12

For Online Access

Best Paper Award Selection - Editorial Board Site

Add subscription to shopping cart

2007, Volume39

Issue 1

  82 pages  

DOI: 10.1615/J Automat Inf Scien.v39.i1   

click 'Save as...' here to save XML metadata

Issue price - $238.00  

Add to shopping cart

  • Studies of Problems of Combinatorial Optimization of Game Type on Arrangements
  • Oleg A. Emets
    Poltava Consumer Cooperation University of Ukraine, Ukraine

    Natalya Yu. Ustian
    Poltava Consumer Cooperation University of Ukraine, Ukraine


    ABSTRACT

    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.

    DOI: 10.1615/J Automat Inf Scien.v39.i1.30

    Download article, 24-35 pages

    Article price - $35.00  

    Add to shopping cart

    << Previous article   Next article >>

    Designed by offsiteteam Designed by offsiteteam Designed by offsiteteam
    Begell House Inc.
    50 Cross Highway,
    Redding, CT 06896
    TEL (203) 938 1300
    FAX (203) 938 1304
    orders@begellhouse.com