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… (More)
Wikipedia

Related topics

Related topics

11 relations
AMPLBenders decompositionColumn generationDecomposition method (constraint satisfaction)
(More)

Broader (1)

Mathematical optimization

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Mechanism Design via Dantzig-Wolfe Decomposition
In random allocation rules, typically first an optimal fractional point is calculated via solving a linear program. Lying in the… (More)
Is this relevant?
2014
2014
Distributed energy management of microgrids with Dantzig-Wolfe decomposition
Distributed management of microgrids is a vital problem to provide scalability to the next-generation electricity grids. Energy… (More)
  • figure 1
  • table I
  • figure 3
  • figure 2
Is this relevant?
2013
2013
A stabilized structured Dantzig-Wolfe decomposition method
We present an algorithmic scheme, which we call the Structured Dantzig-Wolfe decomposition method, that can be used for solving… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
2013
2013
Hierarchical Demand Response using Dantzig-Wolfe decomposition
Demand Side Management (DSM) programmes are designed to shift electrical loads from peak times. Demand Response (DR) algorithms… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2013
2013
Algorithm 928: A general, parallel implementation of dantzig-wolfe decomposition
Dantzig--Wolfe Decomposition is recognized as a powerful, algorithmic tool for solving linear programs of block-angular form… (More)
  • figure 1
  • figure 2
  • figure 3
  • table I
Is this relevant?
2010
2010
Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs
We report on experiments with turning the branch-price-andcut framework SCIP into a generic branch-price-and-cut solver. That is… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
Is this relevant?
2010
2010
Dantzig-Wolfe decomposition and column generation
Here X is a vector of variables, all lying in the set S. The cost vector is denoted c. A is a matrix, b a vector, and together… (More)
  • figure 1
Is this relevant?
2009
2009
DANTZIG-WOLFE DECOMPOSITION WITH GAMS
This document illustrates the Dantzig-Wolfe decomposition algorithm using GAMS. 
  • figure 1
Is this relevant?
2004
2004
DANTZIG-WOLFE DECOMPOSITION AND LARGE-SCALE CONSTRAINED MPC PROBLEMS
Model Predictive Control (MPC) strategies are typically implemented in two levels: a steady-state target calculation and a… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
2000
Highly Cited
2000
On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
Dantzig-Wolfe decomposition as applied to an integer program is a speci#c form of problem reformulation that aims at providing a… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?