Computational experience with hypergraph-based methods for automatic decomposition in discrete optimization
From MaRDI portal
Recommendations
- Decomposition Branching for Mixed Integer Programming
- Combinatorial decomposition and industrial applications.
- Decomposition in integer linear programming
- On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
- A data driven Dantzig-Wolfe decomposition framework
Cited in
(13)- A graph-based modeling abstraction for optimization: concepts and implementation in Plasmo.jl
- A hypergraph framework for optimal model-based decomposition of design problems
- Consistency cuts for Dantzig-Wolfe reformulations
- Random sampling and machine learning to understand good decompositions
- High-multiplicity \(N\)-fold IP via configuration LP
- A data driven Dantzig-Wolfe decomposition framework
- Structure Detection in Mixed-Integer Programs
- Matrices of optimal tree-depth and a row-invariant parameterized algorithm for integer programming
- Learning when to use a decomposition
- Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming
- Automatic Dantzig-Wolfe reformulation of mixed integer programs
- Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes
- Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs
This page was built for publication: Computational experience with hypergraph-based methods for automatic decomposition in discrete optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4922931)
