Column generation for linear and integer programming

zbMath1267.90004MaRDI QIDQ1946009

Nemhauser, George I.

Publication date: 17 April 2013

Published in: Documenta Mathematica (Search for Journal in Brave)

Full work available at URL: http://www.emis.de/journals/DMJDMV/vol-ismp/21_nemhauser-george-colgen.html

zbMATH Keywords

linear programminginteger programmingdecompositioncolumn generationbranch-and-priceset partitioning

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Linear programming (90C05) History of mathematics in the 20th century (01A60) History of operations research and mathematical programming (90-03) Bibliographic studies (01A90)

Related Items (3)

Decomposition-based heuristic for the zoning and crop planning problem with adjacency constraints ⋮ Integer rounding and modified integer rounding for the skiving stock problem ⋮ Supersaturated designs with the maximum number of factors for a given resolution-rank

This page was built for publication: Column generation for linear and integer programming