Abstract
We present a new approach to create instances with high absolute worst-case performance ratio of common lower bounds for the two-dimensional rectangular Strip Packing Problem. The idea of this new approach is to optimize the width and the height of all items regarding the absolute worst case performance ratio of the lower bound. Therefore, we model the pattern related to the lower bound as a solution of an ILP problem and merge this model with the Padberg-type model of the two-dimensional Strip Packing Problem. The merged model maximizes the absolute worst-case performance ratio of the lower bound. We introduce this new model for the horizontal bar relaxation and the horizontal contiguous bar relaxation.
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.
