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

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

Volume 45, Numéro 9, 2013, pp. 77-83
DOI: 10.1615/JAutomatInfScien.v45.i9.70
Get accessGet access

RÉSUMÉ

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.

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