Inscrição na biblioteca: Guest
Journal of Automation and Information Sciences

Publicou 12 edições por ano

ISSN Imprimir: 1064-2315

ISSN On-line: 2163-9337

SJR: 0.173 SNIP: 0.588 CiteScore™:: 2

Indexed in

Solving of Discrete Problems of Optimization with Linear-Fractional Objective Function by Branch and Bound Methods

Volume 45, Edição 9, 2013, pp. 77-83
DOI: 10.1615/JAutomatInfScien.v45.i9.70
Get accessGet access

RESUMO

Exact combinatorial method for solving the problems of discrete optimization with linear-fractional objective function is under consideration. The algorithm of branch and bound method was constructed for solving the mentioned problem.

Portal Digital Begell Biblioteca digital da Begell eBooks Diários Referências e Anais Coleções de pesquisa Políticas de preços e assinaturas Begell House Contato Language English 中文 Русский Português German French Spain