A polyhedral study of the single-item lot-sizing problem with continuous start-up costs

DOI10.1016/j.endm.2011.05.045zbMath1268.90004OpenAlexW2002250263MaRDI QIDQ2840719

Javier Marenco, María del Carmen Varaldo, Mariana S. Escalante

Publication date: 23 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2011.05.045

zbMATH Keywords

polyhedral combinatoricscontinuous start-uplot-sizing

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Inventory, storage, reservoirs (90B05)

Related Items (3)

Single-item dynamic lot-sizing problems: an updated survey ⋮ Dynamic optimization for coordinated replenishment system considering seasonal demand and price quantity discount ⋮ The single-item lot-sizing polytope with continuous start-up costs and uniform production capacity

Cites Work

• A cutting plane approach to capacitated lot-sizing with start-up costs
• Polyhedral Characterization of the Economic Lot-Sizing Problem with Start-Up Costs

This page was built for publication: A polyhedral study of the single-item lot-sizing problem with continuous start-up costs