Decomposition and reformulation of integer linear programming problems. (Summary)

DOI10.1007/s10288-011-0178-4zbMath1362.90296OpenAlexW2063718353MaRDI QIDQ1936665

Fabio Furini

Publication date: 6 February 2013

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-011-0178-4

zbMATH Keywords

Dantzig-Wolfe reformulation

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05)

Related Items

A combinatorial flow-based formulation for temporal bin packing problems, A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size, Solving the temporal knapsack problem via recursive Dantzig-Wolfe reformulation