01.1996 - 01.1998 ,    Код проекта: 521436/96-6(NV)  Описание Aggregation bounds are considered for integer programing problems. A novel approach based on the localization of the optimal solution is proposed. The approach is applied to integer programs to get the bounds tighter than the standard linear programming relaxation does. To strengthening the localization the valid inequalities/cuts are used  Ключевые слова bounds for the aggregation error, localization of the optimal solution, integer programming