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

DOI10.1287/MOOR.16.3.504MaRDI QIDQ3986754zbMATH OpenOpenAlexFDO

Authors 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) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Abstract computational complexity for mathematical programming problems (90C60) Inventory, storage, reservoirs (90B05) Production models (90B30)

Recommendations

• A discrete EOQ problem is solvable in \(O(\log n)\) time
• scientific article; zbMATH DE number 4149861
• TECHNICAL NOTE—Solving Linear Cost Dynamic Lot-Sizing Problems in O(n log n) Time
• Minimum-aggregate-concave-cost multicommodity flows in strong-series-parallel networks

Cited in

(3)

• Reducing Separable Convex Programs with Tree Constraints
• Improved randomized approximation algorithms for lot-sizing problems
• Tree-sparse convex programs

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

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