Skip to search formSkip to main contentSkip to account menu

Dantzig–Wolfe decomposition

Known as: Dantzig-wolfe decomposition 
Dantzig–Wolfe decomposition is an algorithm for solving linear programming problems with special structure. It was originally developed by George… 
Wikipedia (opens in a new tab)

Related topics

Related topics

12 relations
AMPLBenders decompositionColumn generationDecomposition method (constraint satisfaction)

Broader (1)

Mathematical optimization

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs
We report on experiments with turning the branch-price-and-cut frameworkSCIP into a generic branch-price-and-cut solver. That is… 
Highly Cited
2009
Highly Cited
2009
Dantzig-Wolfe Decomposition for Solving Multistage Stochastic Capacity-Planning Problems
We describe a multistage, stochastic, mixed-integer programming model for planning capacity expansion of production facilities. A… 
2009
2009
Agent-Based Dantzig-Wolfe Decomposition
We present an agent-based approach to Dantzig-Wolfe column generation (a decomposition approach), which is applied to an… 
2009
2009
DANTZIG-WOLFE DECOMPOSITION WITH GAMS
This document illustrates the Dantzig-Wolfe decomposition algorithm using GAMS. 
Highly Cited
2006
Highly Cited
2006
A generic view of Dantzig-Wolfe decomposition in mixed integer programming
Highly Cited
2005
Highly Cited
2005
Long-term security-constrained unit commitment: hybrid Dantzig-Wolfe decomposition and subgradient approach
The solution of a long-term security-constrained unit commitment (SCUC) problem, which often spans several months to a year, may… 
2003
2003
DANTZIG-WOLFE DECOMPOSITION WITH GAMS
This document illustrates the Dantzig-Wolfe decomposition algorithm using GAMS. 
Highly Cited
2001
Highly Cited
2001
The UCSD HIRES/Keck I Damped Lyα Abundance Database. II. The Implications
We present a comprehensive analysis of the damped Lyα (DLA) abundance database presented in the first paper of this series. This… 
Highly Cited
1981
Highly Cited
1981
An advanced implementation of the Dantzig—Wolfe decomposition algorithm for linear programming
Since the original work of Dantzig and Wolfe in 1960, the idea of decomposition has persisted as an attractive approach to large… 
Highly Cited
1981
Highly Cited
1981
Constrained Economic Dispatch of Multi-Area Systems Using the Dantzig-Wolfe Decomposition Principle
The economic dispatch problem with constraints on line flows and spinning reserve is formulated as a linear optimization program… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)