A Lot-Sizing Problem on Trees, Related to Network Design

DOI10.1287/MOOR.18.2.402MaRDI QIDQ5287989zbMATH OpenOpenAlexFDO

Authors Daniel Bienstock

Publication date 5 August 1993

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

Full work available at URL https://doi.org/10.1287/moor.18.2.402

zbMATH Keywords

\(\varepsilon\)- approximate algorithmscapacity expansioneconomic lot-sizingknapsacktrees

Mathematics Subject Classification ID

Connectivity (05C40) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Communication networks in operations research (90B18) Production models (90B30) Programming involving graphs or networks (90C35) Applications of graph theory to circuits and networks (94C15)

Recommendations

• Lot-sizing on a tree
• Algorithms for Capacitated, Multi-Item Lot-Sizing without Set-Ups
• Lot-sizing with non-stationary cumulative capacities
• Lot-Sizing with Constant Batches: Formulation and Valid Inequalities

Cited in

(2)

• An Oracle Strongly Polynomial Algorithm for Bottleneck Expansion Problems
• Lot-sizing on a tree

This page was built for publication: A Lot-Sizing Problem on Trees, Related to Network Design

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