Minimizing Separable Convex Objectives on Arbitrarily Directed Trees of Variable Upper Bound Constraints

DOI10.1287/MOOR.16.3.504zbMath0742.90081OpenAlexW2107771431MaRDI QIDQ3986754

Peter L. Jackson, Robin Roundy

Publication date: 27 June 1992

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

Full work available at URL: https://hdl.handle.net/1813/8650

zbMATH Keywords

Economic Order Quantitymulti-stage production-distribution systemsseries-parallel digraph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Production models (90B30) Inventory, storage, reservoirs (90B05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (1)

Improved randomized approximation algorithms for lot-sizing problems

This page was built for publication: Minimizing Separable Convex Objectives on Arbitrarily Directed Trees of Variable Upper Bound Constraints