Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs
- 1 January 2010
- book chapter
- Published by Springer Nature
- p. 239-252
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Dantzig-Wolfe decomposition and branch-and-price solving in G12Constraints, 2009
- SCIP: solving constraint integer programsMathematical Programming Computation, 2009
- A generic view of Dantzig–Wolfe decomposition in mixed integer programmingOperations Research Letters, 2006
- Implementing Mixed Integer Column Generation2006
- Decomposition and Dynamic Cut Generation in Integer Linear ProgrammingMathematical Programming, 2005
- A branch‐and‐price algorithm for the capacitated p‐median problemNetworks, 2005
- Branching rules revisitedOperations Research Letters, 2005
- The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimizationSoftware: Practice and Experience, 2000
- On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price AlgorithmOperations Research, 2000
- MINTO, a mixed INTeger optimizerOperations Research Letters, 1994