|
Поиск атрибутный
| |
|
|
|
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 |
|