Commit 1eecacf7 authored by MIPLIB Submitter's avatar MIPLIB Submitter

New submission at 2017-02-25 03:40:42.612187

parent 5c9911c9
company: Universidade Federal de Ouro Preto - UFOP
creator: Cézar Augusto Nascimento e Silva, under Bachelor's Degree and Haroldo Gambini
Santos, Ph.D.
description: "\tIn the Graph Drawing problem a set of symbols must be placed in a\
\ plane and their connections routed. The objective is to produce aesthetically\
\ pleasant, easy to read diagrams. As a primary concern one usually tries to minimize\
\ edges crossing, edges' length, waste of space and number of bents in the connections.\
\ When formulated with these constraints the problem becomes NP-Hard\\cite{gdnphard}.\
\ In practice many additional complicating requirements can be included, such as\
\ non-uniform sizes for symbols\\cite{dgnuv}. Thus, some heuristics such as the\
\ generalized force-direct method and Simulated Annealing \\cite{ron} have been\
\ proposed to tackle this problem. \\cite{calerd} uses a grid structure to approach\
\ the Entity-Relationship (ER) drawing problem, emphasizing the differences between\
\ ER drawing and the more classical circuit drawing problems. \\cite{tamassia} presented\
\ different ways of producing graph layouts (e.g.: tree, orthogonal, visibility\
\ representations, hierarchic, among others) for general graphs with applications\
\ on different subjects.\r\n\t\r\n\tThe ability to automatically produce high quality\
\ layouts is very important in many applications, one of these is Software Engineering:\
\ the availability of easy to understand ER diagrams, for instance, can improve\
\ the time needed for developers to master database models and increase their productivity.\
\ Our solution approach involves two phases: ($i$) firstly the optimal placement\
\ of entities is solved, i.e.: entities are positioned so as to minimize the distances\
\ between connected entities; and ($ii$) secondly, edges are routed minimizing bends\
\ and avoiding the inclusion of connectors too close. We present the model for the\
\ first phase of our problem."
email: cans5812@gmail.com
license: cc-license
name: Cézar Augusto Nascimento e Silva
other-license: ''
owner: Universidade Federal de Ouro Preto - UFOP
This source diff could not be displayed because it is stored in LFS. You can view the blob instead.
@article{forcedirect,
title={Graph drawing by force-directed placement},
author={Fruchterman, Thomas MJ and Reingold, Edward M},
journal={Software: Practice and experience},
volume={21},
number={11},
pages={1129--1164},
year={1991},
publisher={Wiley Online Library}
}
@article{tamassia,
author = {Roberto Tamassia, Giuseppe Di Battista, Carlo Batini},
title = {Automatic Graph Drawing and
Readability of Diagrams},
journal = {IEEE Transactions On Systems, Man and Cybernetics},
month = {January/February},
year = {1988},
OPTlanguage = {english},
OPToriglanguage = {english},
OPTseries = {series},
volume = {18},
OPTnumber = {1},
pages = {61-79}
}
@article{nenad,
author = {Nenad Mladenovi\'{c}, Pierre Hansen },
title = {Variable Neighborhood Search},
journal = {Computers \& Operations Research},
publisher= {Pergamon},
year = {1997},
volume = {24},
issue = {11},
pages = {1097-1100}
}
@article{calerd,
author = {C.Batini, M.Talamo, R.Tamassia},
title = {Computer Aided Layout of Entity Relationship Diagrams},
journal = {The Journal of Systems and Software},
publisher = {Elsevicr Science Publishing Co., Inc., 1984},
year = {1984},
pages = {163-173},
volume = {4},
}
@inproceedings{dgnuv,
author = {David Harel, Yehuda Koren},
title = {Drawing Graphs with Non-Uniform Vertices},
booktitle={Proceedings of the Working Conference on Advanced Visual Interfaces},
pages={157-166},
year={2002},
organization={ACM}
}
@incollection{ga2dpacking,
title={A biased random key genetic algorithm for 2D and 3D bin packing problems},
publisher={Int. J. Production Economics},
author={José Fernando Gonçalves;Mauricio G.C. Resende},
year={2013},
month = {April},
day = {18},
language={English}
}
@article{sun,
author = {J. Sun},
title = {Authomatic Orthogonal Graph Layout},
journal = { Master's Dissertation, Hamburg University of Technology},
year = {2007},
month = {June},
}
@article{kirk,
author = {S. Kirkpatrick, C. D. Gelatt, M. P. Vecchi},
title = {Optimization by Simulated Annealing},
journal = {Science},
journalsubtitle = {New Series},
language = {english},
origlanguage = {english},
volume = {220},
number = {4598},
month = {May},
year = {1983},
pages = {671-680},
editor = {American Association for the Advancement of Science}
}
@misc{yed,
howpublished = {http://www.yworks.com/en/products/yfiles/yed/},
author = {\textbf{yEd Works the diagramming company}},
year = {2015},
month = {Junho}
}
@misc{neato,
title = {Graphviz( http://www.graphviz.org,http://www.graphviz.org/pdf/neatoguide.pdf)},
author = {\textbf{Graphviz - Graph Visualization Software,Envisioning connections}},
year = {2015},
month = {Junho}
}
@misc{gtk,
title = {GTK+, or the GIMP Toolkit, is a multi-platform toolkit for creating graphical user interfaces( http://www.gtk.org)},
author = {\textbf{The GTK+ Project}},
year = {2015},
month = {Junho}
}
@article{ron,
author = {Ron Davidson And David Harel},
title = {Drawing Graphs Nicely Using Simulated Annealing},
journal = {ACM Transactions on Graphics},
month = {October},
year = {1996},
volume = {15},
number = {4},
pages={301--331},
publisher={ACM}
}
@article{gdnphard,
author = {D.S. Johnson},
title = {The {N}{P}-Completeness Column: An Ongoing Guide},
journal= {J. Algorithms},
volume={3},
pages={88-89},
year={1982}
}
@inproceedings{gadug,
title={Using genetic algorithms for drawing undirected graphs},
author={Branke, J{\"u}rgen and Bucher, Frank and Schmeck, Hartmut},
booktitle={The Third Nordic Workshop on Genetic Algorithms and their Applications},
year={1996},
pages = {193--206}
organization={Citeseer}
}
@incollection{graphviz,
year={2002},
isbn={978-3-540-43309-5},
booktitle={Graph Drawing},
volume={2265},
series={Lecture Notes in Computer Science},
editor={Mutzel, Petra and Jünger, Michael and Leipert, Sebastian},
doi={10.1007/3-540-45848-4_57},
title={Graphviz— Open Source Graph Drawing Tools},
url={http://dx.doi.org/10.1007/3-540-45848-4_57},
publisher={Springer Berlin Heidelberg},
author={\textbf{Ellson, John and Gansner, Emden and Koutsofios, Lefteris and North, StephenC. and Woodhull, Gordon}},
pages={483-484},
language={English}
}
@article{seqvnd,
title={Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem},
author={Mjirda, Anis and Todosijevi{\'c}, Raca and Hanafi, Sa{\"\i}d and Hansen, Pierre and Mladenovi{\'c}, Nenad},
journal={International Transactions in Operational Research},
year={2016},
publisher={Wiley Online Library}
}
@article{Souza2010,
title = "A hybrid heuristic algorithm for the open-pit-mining operational planning problem",
journal = "European Journal of Operational Research",
volume = "207",
number = "2",
pages = "1041 - 1051",
year = "2010",
issn = "0377-2217",
doi = "10.1016/j.ejor.2010.05.031",
url = "http://www.sciencedirect.com/science/article/pii/S0377221710003875",
author = "Souza, Marcone J.F. and Coelho, Igor M. and Ribas, Sabir and Santos, Haroldo G. and Merschmann, Luiz H.C.",
keywords = "Open-pit-mining",
keywords = "Metaheuristics",
keywords = "<span style='font-family : courier'>GRASP</span>",
keywords = "Variable neighborhood search",
keywords = "Mathematical programming"
}
\ No newline at end of file
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment