A decomposition procedure for one class of block programming problems

Общая информация

 Аннотация

    Large-scale block-diagonal linear and mixed-integer programming problems solvable by Dantzig-Wolfe and Benders methods are considered. Algorithms exploiting the specific structure of the problems are constructed. Results of numerical experiments are reported.

 Ключевые слова

    Large-scale block-diagonal linear and mixed-integer programming; numerical experiments
 

Home page
Наш адрес:
119991 ГСП-1 Москва В-71, Ленинский просп., 14
Телефон: 938-0309 (Справ. бюро)
Факс: (495)954-3320 (Лен.пр.,14), (495)938-1844 (Лен.пр.,32а)
Назад