A data driven Dantzig-Wolfe decomposition framework

DOI10.1007/s12532-022-00230-4zbMath1519.90126OpenAlexW4308159042MaRDI QIDQ6102860

Saverio Basso, Alberto Ceselli

Publication date: 23 June 2023

Published in: Mathematical Programming Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12532-022-00230-4

zbMATH Keywords

decomposition methodsautomatic decomposition of MIPs

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Cites Work

• Unnamed Item
• Improving branch-and-cut performance by random sampling
• SCIP: solving constraint integer programs
• The strength of Dantzig-Wolfe reformulations for the stable set and related problems
• Learning when to use a decomposition
• Machine learning for combinatorial optimization: a methodological tour d'horizon
• A branch-and-price algorithm for capacitated hypergraph vertex separation
• Computational evaluation of data driven local search for MIP decompositions
• Random sampling and machine learning to understand good decompositions
• Dantzig-Wolfe decomposition and branch-and-price solving in G12
• MIPLIB 2003
• Automatic Dantzig-Wolfe reformulation of mixed integer programs
• Distributed asynchronous column generation
• Reformulation and Decomposition of Integer Programs
• Computational Experience with Hypergraph-Based Methods for Automatic Decomposition in Discrete Optimization
• Structure Detection in Mixed-Integer Programs
• A Computational Investigation on the Strength of Dantzig-Wolfe Reformulations
• Asynchronous Column Generation
• Mixed Integer Programming: Analyzing 12 Years of Progress
• Column Generation

This page was built for publication: A data driven Dantzig-Wolfe decomposition framework