Column generation for linear and integer programming

zbMATH Open1267.90004MaRDI QIDQ1946009FDOQ1946009

Authors: G. L. Nemhauser 

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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

linear programmingdecompositioninteger programmingcolumn generationbranch-and-priceset partitioning

Mathematics Subject Classification ID

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

Cited In (5)

• Decomposition-based heuristic for the zoning and crop planning problem with adjacency constraints
• Assessing the benefits of storage and transshipments yards in timber supply chains by a column generation + GRASP approach
• Assigning stationary distributions to sparse stochastic matrices
• 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

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