A decomposition procedure for one class of block programming problems

A decomposition procedure for one class of block programming problems

0.00 Avg rating0 Votes
Article ID: iaor19921505
Country: United Kingdom
Volume: 29
Start Page Number: 233
End Page Number: 238
Publication Date: Dec 1989
Journal: USSR Computational Mathematics and Mathematical Physics
Authors:
Keywords: programming: integer
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.