Decomposition of linear programs by dynamic programming

DOI10.1002/nav.3800110206zbMath0136.14105OpenAlexW2049098176MaRDI QIDQ5510362

Nemhauser, George I.

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

Related Items (9)

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

Cites Work

• Unnamed Item
• Unnamed Item

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