THE DICHOTOMOUS PROGRAMMING METHOD IN DISCRETE OPTIMIZATION

摘要

The problem of additive function minimization under the restriction, given by the function, admitting dichotomous representation (calculation of the function's values is reduced to sequential calculation of the values of functions of two variables) is considered. A method for calculation of lower estimations and the method of branches and bounds, based on these estimations, are described.