Abstract
We study integer programming (ip) models for the problem of finding a rectangular partition of a rectilinear polygon with minimum stabbing number. Strong valid inequalities are introduced for an existing formulation and a new model is proposed. We compare the dual bounds yielded by the relaxations of the two models and prove that the new one is stronger than the old one. Computational experiments with the problem are reported for the first time in which polygons with thousands of vertices are solved to optimality. The (ip) branch-and-bound algorithm based on the new model is faster and more robust than those relying on the previous formulation.
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.
