Сравнение двух субградиентных методов при нахождении оценок для задач размещения

Abstract

We consider and compare two subgradient type methods ("simple' and r-algorithm) for finding lower bounds in branch-and-bound method while solving allocation type problem with new kinds of discounts in the objective function. We outline the model and algorithms for solving the allocation problems and report results of computational experiments.