Minimum Stabbing Rectangular Partitions Of Rectilinear Polygons

Piva, Breno; Souza, Cid C. de

Please use this identifier to cite or link to this item: http://repositorio.unicamp.br/jspui/handle/REPOSIP/329873

Type:	Artigo
Title:	Minimum Stabbing Rectangular Partitions Of Rectilinear Polygons Minimum stabbing rectangular partitions of rectilinear polygons
Author:	Piva, Breno Souza, Cid C. de
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. (C) 2016 Elsevier Ltd. All rights reserved. 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
Subject:	Stabbing Number Rectangular Partition Rectilinear Polygons Integer Programming Algoritmos branch-and-cut Programação inteira Geometria computacional Otimização combinatória
Country:	Reino Unido
Editor:	Elsevier
Citation:	Computers & Operations Research. Pergamon-elsevier Science Ltd , v. 80, p. 184 - 197, 2017.
Rights:	fechado Fechado
Identifier DOI:	10.1016/j.cor.2016.12.014
Address:	https://www.sciencedirect.com/science/article/pii/S030505481630315X
Date Issue:	2017
Appears in Collections:	IC - Artigos e Outros Documentos

Files in This Item:

File	Size	Format
000392889600016.pdf	1.29 MB	Adobe PDF	View/Open

Show full item record Recommend this item