A Modified Linear Program for Columnar Methods in Mathematical Programming

DOI10.1287/OPRE.19.4.1051MaRDI QIDQ5629425zbMATH OpenOpenAlexFDO

Authors G. L. Nemhauser, William B. Widhelm

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)

Cited in

(9)

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

This page was built for publication: A Modified Linear Program for Columnar Methods in Mathematical Programming

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