Pages that link to "Item:Q4922931"
From MaRDI portal
The following pages link to Computational Experience with Hypergraph-Based Methods for Automatic Decomposition in Discrete Optimization (Q4922931):
Displaying 13 items.
- A hypergraph framework for optimal model-based decomposition of design problems (Q1366302) (← links)
- Learning when to use a decomposition (Q2011591) (← links)
- A graph-based modeling abstraction for optimization: concepts and implementation in Plasmo.jl (Q2099497) (← links)
- Random sampling and machine learning to understand good decompositions (Q2288981) (← links)
- Automatic Dantzig-Wolfe reformulation of mixed integer programs (Q2515047) (← links)
- Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes (Q2696926) (← links)
- Consistency Cuts for Dantzig-Wolfe Reformulations (Q5058051) (← links)
- Structure Detection in Mixed-Integer Programs (Q5136081) (← links)
- Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs (Q5219296) (← links)
- Matrices of Optimal Tree-Depth and a Row-Invariant Parameterized Algorithm for Integer Programming (Q5864669) (← links)
- High-multiplicity \(N\)-fold IP via configuration LP (Q6044979) (← links)
- A data driven Dantzig-Wolfe decomposition framework (Q6102860) (← links)
- Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming (Q6634533) (← links)
