Automatic Dantzig–Wolfe reformulation of mixed integer programs
Open Access
- 5 March 2014
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 149 (1-2) , 391-424
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Uncommon Dantzig-Wolfe Reformulation for the Temporal Knapsack ProblemINFORMS Journal on Computing, 2013
- Computational Experience with Hypergraph-Based Methods for Automatic Decomposition in Discrete Optimization2013
- Dantzig-Wolfe decomposition and branch-and-price solving in G12Constraints, 2009
- Permuting Sparse Rectangular Matrices into Block-Diagonal FormSIAM Journal on Scientific Computing, 2004
- Benchmarking optimization software with performance profilesMathematical Programming, 2002
- Stabilized column generationDiscrete Mathematics, 1999
- Partitioning mathematical programs for parallel solutionMathematical Programming, 1998
- Decomposing Matrices into BlocksSIAM Journal on Optimization, 1998
- Robust Locally Weighted Regression and Smoothing ScatterplotsJournal of the American Statistical Association, 1979
- Lagrangean relaxation for integer programming1974