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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Estimating the most likely configuration (MAP) is one of the fundamental tasks in probabilistic models. While MAP inference is… 
2013
2013
Demand Side Management (DSM) programmes are designed to shift electrical loads from peak times. Demand Response (DR) algorithms… 
2010
2010
We study the problem of computing general static-arbitrage bounds for European basket options; that is, computing bounds on the… 
2010
2010
This paper presents a new methodology for solving the optimal VAr planning problem in multi-area electric power systems, using… 
2009
2009
This document illustrates the Dantzig-Wolfe decomposition algorithm using GAMS. 
2003
2003
This document illustrates the Dantzig-Wolfe decomposition algorithm using GAMS. 
1989
1989
Decomposition methods for linear programs are now classical research interests. We revisit this issue, however, in the context of… 
1985
1985
In this paper, we show how Dantzig-Wolfe decomposition, with delayed column generation by means of dynamic programming, can be… 
1983
1983
The initial representation of an LP problem to which the Dantzig-Wolfe decomposition procedure is applied, is of the essence. We…