Automatic Dantzig-Wolfe reformulation of mixed integer programs
From MaRDI portal
Publication:2515047
Recommendations
- Partial convexification of general mips by Dantzig-Wolfe reformulation
- A data driven Dantzig-Wolfe decomposition framework
- Learning when to use a decomposition
- A Computational Investigation on the Strength of Dantzig-Wolfe Reformulations
- A generic view of Dantzig--Wolfe decomposition in mixed integer programming
Cites work
- A Primer in Column Generation
- A structure-conveying modelling language for mathematical and stochastic programming
- A Structure-Exploiting Tool in Algebraic Modeling Languages
- A tightly integrated modelling and optimisation library: A new framework for rapid algorithm development
- Benchmarking optimization software with performance profiles.
- Column Generation
- Computational experience with hypergraph-based methods for automatic decomposition in discrete optimization
- Dantzig-Wolfe decomposition and branch-and-price solving in G12
- Decomposing Matrices into Blocks
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- MIPLIB 2003
- Partial convexification of general mips by Dantzig-Wolfe reformulation
- Partitioning mathematical programs for parallel solution
- Permuting Sparse Rectangular Matrices into Block-Diagonal Form
- Rearranging Matrices to Block-Angular form for Decomposition (And Other) Algorithms
- Reformulation and decomposition of integer programs
- Robust Locally Weighted Regression and Smoothing Scatterplots
- Stabilized column generation
Cited in
(35)- An exact algorithm for the partition coloring problem
- The strength of Dantzig-Wolfe reformulations for the stable set and related problems
- Learning when to use a decomposition
- Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework
- Parallel subgradient algorithm with block dual decomposition for large-scale optimization
- A graph-based modeling abstraction for optimization: concepts and implementation in Plasmo.jl
- Dantzig-Wolfe reformulations for binary quadratic problems
- Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems
- A branch-and-price algorithm for capacitated hypergraph vertex separation
- A decomposition heuristic for mixed-integer supply chain problems
- Split cuts from sparse disjunctions
- Computational evaluation of data driven local search for MIP decompositions
- Random sampling and machine learning to understand good decompositions
- Price-and-verify: a new algorithm for recursive circle packing using Dantzig-Wolfe decomposition
- Parallel PIPS-SBB: multi-level parallelism for stochastic mixed-integer programs
- A generic view of Dantzig--Wolfe decomposition in mixed integer programming
- Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems
- Distributed asynchronous column generation
- Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes
- A horizon decomposition approach for the capacitated lot-sizing problem with setup times
- Local cuts and two-period convex hull closures for big-bucket lot-sizing problems
- Partial convexification of general mips by Dantzig-Wolfe reformulation
- Consistency cuts for Dantzig-Wolfe reformulations
- Decomposition Branching for Mixed Integer Programming
- Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem
- Structure Detection in Mixed-Integer Programs
- A Computational Investigation on the Strength of Dantzig-Wolfe Reformulations
- Matrices of optimal tree-depth and a row-invariant parameterized algorithm for integer programming
- Solving the temporal knapsack problem via recursive Dantzig-Wolfe reformulation
- High-multiplicity \(N\)-fold IP via configuration LP
- Integer programming column generation: accelerating branch-and-price using a novel pricing scheme for finding high-quality solutions in set covering, packing, and partitioning problems
- A data driven Dantzig-Wolfe decomposition framework
- Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming
- Lagrangian dual for integer optimization with zero duality gap that admits decomposition
- Last fifty years of integer linear programming: a focus on recent practical advances
This page was built for publication: Automatic Dantzig-Wolfe reformulation of mixed integer programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2515047)
