Library Subscription: Guest
Journal of Automation and Information Sciences

Published 12 issues per year

ISSN Print: 1064-2315

ISSN Online: 2163-9337

SJR: 0.173 SNIP: 0.588 CiteScore™:: 2

Indexed in

Polynomial Method for Solving Unconditional Linear Fractional Problem of Combinatorial Optimization on Arrangements

Volume 49, Issue 3, 2017, pp. 46-56
DOI: 10.1615/JAutomatInfScien.v49.i3.60
Get accessGet access

ABSTRACT

The article deals with solving the linear fractional problem of combinatorial optimization on the general set of arrangements. The authors propose and substantiate the method which provides solving the finite sequence of linear unconditional problems of combinatorial optimization on arrangements. Theoretical estimates of the formulated algorithm are obtained, its polynomiality is proved.

CITED BY
  1. Barbolina Tetiana, Estimates of objective function minimum for solving linear fractional unconstrained combinatorial optimization problems on arrangements, Physico-mathematical modelling and informational technologies, 32, 2021. Crossref

Begell Digital Portal Begell Digital Library eBooks Journals References & Proceedings Research Collections Prices and Subscription Policies Begell House Contact Us Language English 中文 Русский Português German French Spain