Abstract
Solving the one-dimensional cutting stock problem under discrete, uncertain, time-varying demands using a hybrid of special-purpose Benders' decomposition and column generation
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Mathematics in Operational Research
Paper Title
Journal
Date
