Erratum: a tight formulation for uncapacitated lot-sizing with stock upper bounds

DOI10.1007/s10107-016-0999-1zbMath1476.90212OpenAlexW2328249793MaRDI QIDQ507343

Laurence A. Wolsey

Publication date: 3 February 2017

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-016-0999-1

zbMATH Keywords

convex hullmixed integer programminglot-sizingstock fixed costsstock upper bounds

Mathematics Subject Classification ID

Mixed integer programming (90C11) Production models (90B30) Combinatorial optimization (90C27) Inventory, storage, reservoirs (90B05)

Related Items (1)

Convex hull results for generalizations of the constant capacity single node flow set

Cites Work

• A note on ``Lot-sizing with fixed charges on stocks: the convex hull
• Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times
• An \(O(n^2)\) algorithm for lot sizing with inventory bounds and fixed costs
• Four equivalent lot-sizing models
• Lot-sizing with fixed charges on stocks: the convex hull
• Lot-sizing with production and delivery time windows
• Improved algorithms for a lot‐sizing problem with inventory bounds and backlogging
• Capacitated Multi-Item Lot-Sizing Problems with Time Windows
• Bounded Production and Inventory Models with Piecewise Concave Costs
• Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation
• Dynamic lot‐sizing model with production time windows

This page was built for publication: Erratum: a tight formulation for uncapacitated lot-sizing with stock upper bounds