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

DOI10.1007/S10288-011-0178-4MaRDI QIDQ1936665zbMATH OpenOpenAlexFDO

Authors 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

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

Cited in

(5)

• scientific article; zbMATH DE number 3898614 (Why is no real title available?)
• A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size
• A combinatorial flow-based formulation for temporal bin packing problems
• Worst-case analysis of heuristic approaches for the temporal bin packing problem with fire-ups
• Solving the temporal knapsack problem via recursive Dantzig-Wolfe reformulation

This page was built for publication: Decomposition and reformulation of integer linear programming problems. (Summary)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1936665)