Computational evaluation of data driven local search for MIP decompositions

DOI10.1007/978-3-030-34960-8_19zbMATH Open1456.90107OpenAlexW3002152916MaRDI QIDQ2216010FDOQ2216010

Authors: Saverio Basso, Alberto Ceselli 

Publication date: 15 December 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-34960-8_19

Recommendations

• A data driven Dantzig-Wolfe decomposition framework
• Random sampling and machine learning to understand good decompositions
• Learning when to use a decomposition
• Decomposition Branching for Mixed Integer Programming
• Automatic Dantzig-Wolfe reformulation of mixed integer programs

zbMATH Keywords

machine learningDantzig-Wolfe decompositiongeneral purpose solvers

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Cited In (4)

• Random sampling and machine learning to understand good decompositions
• A data driven Dantzig-Wolfe decomposition framework
• Learning when to use a decomposition
• Distributed asynchronous column generation

This page was built for publication: Computational evaluation of data driven local search for MIP decompositions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2216010)