drawing graphs with mathematical programming and variable neighborhood search:(绘制图形和数学规划和可变邻域搜索).pdfVIP

drawing graphs with mathematical programming and variable neighborhood search:(绘制图形和数学规划和可变邻域搜索).pdf

  1. 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  4. 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  5. 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  6. 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  7. 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
drawing graphs with mathematical programming and variable neighborhood search:(绘制图形和数学规划和可变邻域搜索)

Available online at Electronic Notes in Discrete Mathematics 58 (2017) 207–214 /locate/endm Drawing graphs with mathematical programming and variable neighborhood search C´ezar Augusto N. e Silva 1 Haroldo Gambini Santos 2 Departamento de Computa¸c˜ao - Instituto de Ciˆencias Exatas e Biol´ogicas - Universidade Federal de Ouro Preto - Campus Universit´ario Morro do Cruzeiro- 35400-000 Ouro Preto, MG - Brasil Abstract In 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 Pro- gramming (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. Keywords: Grid graph drawing, mixed integer programming, variable neighborhood search. /10.1016/j.endm.2017.03.027 1571-0653/© 2017 Elsevier B.V. All rights reserved

您可能关注的文档

文档评论(0)

18273502 + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档