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

DOI10.1287/MOOR.18.2.402zbMath0780.90045OpenAlexW2078722635MaRDI QIDQ5287989

Bienstock, Daniel

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

treesknapsackcapacity expansioneconomic lot-sizing\(\varepsilon\)- approximate algorithms

Mathematics Subject Classification ID

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

Related Items (1)

An Oracle Strongly Polynomial Algorithm for Bottleneck Expansion Problems

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