Empirical Analysis of Algorithms for Block-Angular Linear Programs
This thesis aims to study the theoretical complexity and empirical performance of decomposition algorithms. We focus on linear programs with a block-angular structure. Decomposition algorithms used to be the only way to solve large-scale special structured problems, in terms of memory limit and CP...
| Main Author: | |
|---|---|
| Language: | en |
| Published: |
2007
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10012/3189 |