A data driven Dantzig-Wolfe decomposition framework
From MaRDI portal
Recommendations
- Random sampling and machine learning to understand good decompositions
- Computational evaluation of data driven local search for MIP decompositions
- Learning when to use a decomposition
- Automatic Dantzig-Wolfe reformulation of mixed integer programs
- Partial convexification of general mips by Dantzig-Wolfe reformulation
Cites work
- scientific article; zbMATH DE number 1775488 (Why is no real title available?)
- A Computational Investigation on the Strength of Dantzig-Wolfe Reformulations
- A branch-and-price algorithm for capacitated hypergraph vertex separation
- Asynchronous column generation
- Automatic Dantzig-Wolfe reformulation of mixed integer programs
- Column Generation
- Computational evaluation of data driven local search for MIP decompositions
- Computational experience with hypergraph-based methods for automatic decomposition in discrete optimization
- Dantzig-Wolfe decomposition and branch-and-price solving in G12
- Distributed asynchronous column generation
- Improving branch-and-cut performance by random sampling
- Learning when to use a decomposition
- MIPLIB 2003
- Machine learning for combinatorial optimization: a methodological tour d'horizon
- Mixed integer programming: analyzing 12 years of progress
- Random sampling and machine learning to understand good decompositions
- Reformulation and decomposition of integer programs
- SCIP: solving constraint integer programs
- Structure Detection in Mixed-Integer Programs
- The strength of Dantzig-Wolfe reformulations for the stable set and related problems
Cited in
(10)- Computational evaluation of data driven local search for MIP decompositions
- Data-Driven Optimization: A Reproducing Kernel Hilbert Space Approach
- A machine learning approach to rank pricing problems in branch-and-price
- Random sampling and machine learning to understand good decompositions
- Ranking Constraint Relaxations for Mixed Integer Programs Using a Machine Learning Approach
- Learning when to use a decomposition
- Accelerating the distance-minimizing method for data-driven elasticity with adaptive hyperparameters
- Automatic Dantzig-Wolfe reformulation of mixed integer programs
- A Data-Driven Iteratively Regularized Landweber Iteration
- Computational experience with hypergraph-based methods for automatic decomposition in discrete optimization
This page was built for publication: A data driven Dantzig-Wolfe decomposition framework
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6102860)
