Abstract
The one-dimensional bin packing problem (1BPP) is one of the most famous problems in combinatorial optimization. The 1BPP is closely related to the one-dimensional cutting stock problem (1CSP) in terms of modeling, however, both problems possess their particularities, especially with respect to solution methods. Therefore, we will consider the 1CSP in another chapter to address the problem specific issues more properly.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
