Solving the one-dimensional cutting stock problem under discrete, uncertain, time-varying demands using a hybrid of special-purpose Benders' decomposition and column generation

DOI10.1504/IJMOR.2021.113578zbMath1482.90029OpenAlexW4254178175MaRDI QIDQ2664617

Peerayuth Charnsethikul, Aphisak Witthayapraphakorn, Sasarose Jaijit

Publication date: 17 November 2021

Published in: International Journal of Mathematics in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1504/ijmor.2021.113578

zbMATH Keywords

Benders' decompositionstochastic linear programmingone-dimensional cutting stock problemlarge-scale linear programminguncertain demands

Mathematics Subject Classification ID

Stochastic programming (90C15) Inventory, storage, reservoirs (90B05)

Related Items (1)

Cutting and packing problems under uncertainty: literature review and classification framework

This page was built for publication: Solving the one-dimensional cutting stock problem under discrete, uncertain, time-varying demands using a hybrid of special-purpose Benders' decomposition and column generation