Inscrição na biblioteca: Guest
Portal Digital Begell Biblioteca digital da Begell eBooks Diários Referências e Anais Coleções de pesquisa
Journal of Automation and Information Sciences
SJR: 0.232 SNIP: 0.464 CiteScore™: 0.27

ISSN Imprimir: 1064-2315
ISSN On-line: 2163-9337

Volumes:
Volume 51, 2019 Volume 50, 2018 Volume 49, 2017 Volume 48, 2016 Volume 47, 2015 Volume 46, 2014 Volume 45, 2013 Volume 44, 2012 Volume 43, 2011 Volume 42, 2010 Volume 41, 2009 Volume 40, 2008 Volume 39, 2007 Volume 38, 2006 Volume 37, 2005 Volume 36, 2004 Volume 35, 2003 Volume 34, 2002 Volume 33, 2001 Volume 32, 2000 Volume 31, 1999 Volume 30, 1998 Volume 29, 1997 Volume 28, 1996

Journal of Automation and Information Sciences

DOI: 10.1615/JAutomatInfScien.v49.i3.60
pages 46-56

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

Oleg A. Iemets
Poltava University of Economics and Trade
Tatyana N. Barbolina
Poltava National V.G. Korolenko Pedagogical University, Poltava

RESUMO

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.