A Modified Linear Program for Columnar Methods in Mathematical Programming

DOI10.1287/opre.19.4.1051zbMath0223.90018OpenAlexW2040751140MaRDI QIDQ5629425

William B. Widhelm, Nemhauser, George I.

Publication date: 1971

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.19.4.1051

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items

A gradient search and column generation approach for the build–pack planning problem with approved vendor matrices and stochastic demand, Robust capacity assignment in telecommunications, An approach to robust network design in telecommunications, Detecting critical node structures on graphs: A mathematical programming approach, A central cutting plane algorithm for the convex programming problem, The Benders decomposition algorithm: a literature review, Production planning with approved vendor matrices for a hard-disk drive manufacturer, A proximal cutting plane method using Chebychev center for nonsmooth convex optimization, Calculating surrogate constraints