Decomposition of linear programs by dynamic programming

DOI10.1002/NAV.3800110206MaRDI QIDQ5510362zbMATH OpenOpenAlexFDO

Authors G. L. Nemhauser

Publication date 1964

Published in Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nav.3800110206

zbMATH Keywords

operations research

Cited in

(9)

• Approximating closed form solutions to converging branch dynamic programming problems
• Closed form solutions to nonserial, nonconvex quadratic programming problems using dynamic programming
• Dual dynamic programming for linear production/inventory systems
• Decomposition of loosely coupled integer programs: a multiobjective perspective
• Decomposition of mathematical programming problems by dynamic programming and its application to block-diagonal geometric programms
• Optimization of large-scale systems
• Revised dantzig-wolfe decomposition for staircase-structured linear programs
• Decomposition of arborescent linear programs
• Beiträge zur Dekomposition von linearen Programmen

This page was built for publication: Decomposition of linear programs by dynamic programming

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