Lot-Sizing with Stock Upper Bounds and Fixed Charges

DOI10.1137/090751451zbMath1218.90136OpenAlexW2109416017MaRDI QIDQ3008012

Marco Di Summa, Laurence A. Wolsey

Publication date: 17 June 2011

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/090751451

zbMATH Keywords

mixed-integer programmingstock fixed costsdiscrete lot-sizingmixing sets

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (2)

Single-item dynamic lot-sizing problems: an updated survey ⋮ A branch-and-cut algorithm for an assembly routing problem

This page was built for publication: Lot-Sizing with Stock Upper Bounds and Fixed Charges