Partitioning mathematical programs for parallel solution
Mathematical Programming: Series A and B
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
SIAM Journal on Scientific Computing
Permuting Sparse Rectangular Matrices into Block-Diagonal Form
SIAM Journal on Scientific Computing
A Freight Service Design Problem for a Railway Corridor
Transportation Science
Experiments with a generic dantzig-wolfe decomposition for integer programs
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Operations Research Letters
Computing with multi-row Gomory cuts
Operations Research Letters
Automatic decomposition and branch-and-price--a status report
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Uncommon Dantzig-Wolfe Reformulation for the Temporal Knapsack Problem
INFORMS Journal on Computing
Hi-index | 0.01 |
Dantzig-Wolfe decomposition is well-known to provide strong dual bounds for specially structured mixed integer programs (MIPs) in practice. However, the method is not implemented in any state-of-the-art MIP solver: it needs tailoring to the particular problem; the decomposition must be determined from the typical bordered block-diagonal matrix structure; the resulting column generation subproblems must be solved efficiently; etc. We provide a computational proof-of-concept that the process can be automated in principle, and that strong dual bounds can be obtained on general MIPs for which a solution by a decomposition has not been the first choice. We perform an extensive computational study on the 0-1 dynamic knapsack problem (without block-diagonal structure) and on general MIPLIB2003 instances. Our results support that Dantzig-Wolfe reformulation may hold more promise as a generalpurpose tool than previously acknowledged by the research community.