Graphical method to solve combinatorial optimization problems


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

Proposed was a graphical method to solve decomposable problems of combinatorial optimization with the of use the Bellman optimality principle. In distinction to the dynamic programming algorithms based on the same principle, the graphical algorithm considers all possible system states by groups and not separately. This becomes possible if one takes into account the analytical form of the objective function, that is, handles the function “graph” and transforms it analytically at each stage. The graphical method enables one to reduce running time of solution of some problems and construct efficient approximation schemes. The results of numerical experiments corroborate efficiency of the of the graphical method.

作者简介

E. Gafarov

Trapeznikov Institute of Control Sciences

编辑信件的主要联系方式.
Email: axel73@mail.ru
俄罗斯联邦, Moscow

补充文件

附件文件
动作
1. JATS XML

版权所有 © Pleiades Publishing, Ltd., 2016