Dantzig-Wolfe Decomposition is a mathematical optimization technique that decomposes a large-scale linear program into a master problem and subproblems by exploiting block-angular structure, enabling efficient solution through column generation and reformulation of the original problem into a set of simpler, linked submodels.
188
Publications
13.1K
Citations
385
Authors
191
Institutions
Publications per year
2017–2026
27
Parents
Publications
188
Selected Topics in Column Generation
Marco E. Lübbecke, Jacques Desrosiers · Operations Research · 2005 · 1.1K citations
1–5 of 188
Authors
385
- MS
7
h-index
- ME
4
h-index
- KA
4
h-index
- JD
4
h-index
- RJ
4
h-index
1–5 of 385
Institutions
191
Illinois Institute of Technology
Chicago, United States
7 h-index
15 publications
1.3K citations
Polytechnique Montréal
Montreal, Canada
5 h-index
10 publications
918 citations
Group for Research in Decision Analysis
Montreal, Canada
5 h-index
11 publications
2.7K citations
HEC Montréal
Montreal, Canada
5 h-index
6 publications
1.6K citations
University of Copenhagen
Copenhagen, Denmark
5 h-index
14 publications
2.2K citations
IBM (United States)
Armonk, United States
4 h-index
8 publications
509 citations
University of Waterloo
Waterloo, Canada
4 h-index
6 publications
108 citations
Stanford University
Stanford, United States
4 h-index
4 publications
79 citations
1–8 of 191
Venues
- Operations Research
24 publications · 4.6K citations
18
h-index
- Management Science
15 publications · 1.2K citations
14
h-index
- IEEE Transactions on Power Systems
14 publications · 1.1K citations
14
h-index
- INFORMS journal on computing
10 publications · 738 citations
10
h-index
- Transportation Science
6 publications · 607 citations
6
h-index
1–5