Abstract
We investigate a heuristic for the two-dimensional rectangular strip packing problem that constructs a feasible two-dimensional packing by placing one-dimensional cutting patterns obtained by solving the horizontal one-dimensional bar relaxation. To represent a solution of the strip packing problem, a solution of a horizontal bar relaxation has to satisfy, among others, the vertical contiguous condition. To strengthen the one-dimensional horizontal bar relaxation with respect to that vertical contiguity new inequalities are formulated. Some computational results are also reported.
Sign-in/Register to access full text options 
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.
