Drawing graphs with mathematical programming and variable neighborhood search.

dc.contributor.authorSilva, Cézar Augusto N.
dc.contributor.authorSantos, Haroldo Gambini
dc.date.accessioned2018-01-24T16:32:22Z
dc.date.available2018-01-24T16:32:22Z
dc.date.issued2017
dc.description.abstractIn the Graph Drawing problem a set of symbols must be placed in a plane and their connections routed. To produce clear, easy to read diagrams, this problem is usually solved trying to minimize edges crossing and the area occupied, resulting in a NP-Hard problem. Our research focuses in drawing Entity Relationship (ER) diagrams, a challenging version of the problem where nodes have different sizes. Mathematical Programming models for the two solution phases, node placement and connection routing, are discussed and their exact resolution by an Integer Programming (IP) solver is evaluated. As the first phase proved to be specially hard to be solved exactly, a hybrid Variable Neighborhood Search (VNS) heuristic is proposed. Using IP techniques we obtained provably optimal (or close to optimal) solutions for the two different phases, at the expense of a large computational effort. We also show that our VNS based heuristic approach can produce close to optimal solutions in very short times for the hardest part of the solution process. Using either methods we have produced clearly better drawings than existing solutions.pt_BR
dc.identifier.citationSILVA, C. A. N.; SANTOS, H. G. Drawing graphs with mathematical programming and variable neighborhood search. Electronic Notes in Discrete Mathematics, v. 58, p. 207-214, 2017. Disponível em: <https://www.sciencedirect.com/science/article/pii/S157106531730063X>. Acesso em: 16 jan. 2018.pt_BR
dc.identifier.doihttps://doi.org/10.1016/j.endm.2017.03.027
dc.identifier.issn1571-0653
dc.identifier.urihttp://www.repositorio.ufop.br/handle/123456789/9337
dc.identifier.uri2https://www.sciencedirect.com/science/article/pii/S157106531730063Xpt_BR
dc.language.isoen_USpt_BR
dc.rightsrestritopt_BR
dc.subjectGrid graph drawingpt_BR
dc.subjectMixed integer programmingpt_BR
dc.subjectVariable neighborhood searchpt_BR
dc.titleDrawing graphs with mathematical programming and variable neighborhood search.pt_BR
dc.typeArtigo publicado em periodicopt_BR
Arquivos
Pacote Original
Agora exibindo 1 - 1 de 1
Nenhuma Miniatura disponível
Nome:
ARTIGO_DrawingGraphsMathematical.pdf
Tamanho:
571.48 KB
Formato:
Adobe Portable Document Format
Licença do Pacote
Agora exibindo 1 - 1 de 1
Nenhuma Miniatura disponível
Nome:
license.txt
Tamanho:
924 B
Formato:
Item-specific license agreed upon to submission
Descrição: