A Computational Investigation on the Strength of Dantzig-Wolfe Reformulations

DOI10.4230/LIPIcs.SEA.2018.11zbMath1496.90037OpenAlexW2808901378MaRDI QIDQ5140720

Marco E. Lübbecke, Michael Bastubbe, Jonas T. Witt

Publication date: 16 December 2020

Full work available at URL: https://doi.org/10.4230/LIPIcs.SEA.2018.11

zbMATH Keywords

column generationLagrangean relaxationDantzig-Wolfe reformulationpartial convexificationstrength of reformulationshierarchy of relaxations

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items

A data driven Dantzig-Wolfe decomposition framework, Split cuts from sparse disjunctions

Uses Software

• MIPLIB
• MIPLIB2003
• GCG

Cites Work

• Unnamed Item
• An exact algorithm for the capacitated facility location problems with single sourcing
• A set partitioning heuristic for the generalized assignment problem
• A genetic algorithm for the generalised assignment problem
• MIPLIB 2003
• A generic view of Dantzig--Wolfe decomposition in mixed integer programming
• Automatic Dantzig-Wolfe reformulation of mixed integer programs
• The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP
• A Column Generation Approach for Graph Coloring