Arc crossing minimization in graphs with GRASP

References

• Carpano , MJ. ( 1980 ) Automatic display of hierarchized graphs for computer aided decision analysis. IEEE Transactions on Systems, Mall, and Cybernetics , 10 ( 11 ), 705 – 715 .
   Web of Science ®Google Scholar
• Catarci . T. ( 1995 ) The assignment heuristic for crossing reduction. IEEE Transactions on Systems. Man, and Cybernetics , 25 ( 3 ), 515 – 520 .
   Web of Science ®Google Scholar
• Di Battista , G.D. , Eades , P. , Tamassia , R. and Tollis , I.G. ( 1999 ) Graph Drawing. Algorithms for' the Visualization of Graphs. Prentice Hall. , Upper Saddle River , NJ .
   Google Scholar
• Eades , P. and Kelly , D. ( 1986 ) Heuristics for drawing 2-layered networks. AI'S Combinatoria , 21 , 89 – 98 .
   Google Scholar
• Eades , P. and Wormald , N.C. ( 1986 ) The median heuristic for drawing two-layered networks. Technical Report 69, Department of Computer Science , University of Queensland, Australia .
   Google Scholar
• Eades , P. and Wormald , N.C. ( 1994 ) Edge crossing in drawings of bipartite graphs. Atgorithmico. , 11 , 379 – 403 .
   Web of Science ®Google Scholar
• FeD , T. and Resende , M.G.C. ( 1989 ) A probabilistic heuristic for a computationally difficult set covering problem. Operations Research Letters , 8 . 67 – 71 .
   Web of Science ®Google Scholar
• Feo , T. and Resende , M.G.C. ( 1995 ) Greedy randomized adaptive search procedures. Journal of Global Optimization. , 2 , 1 – 27 .
   Google Scholar
• Forrester . J.W. ( 1971 ) World Dynamics. Wright Allen. Cambridge , MA .
   Google Scholar
• Gansner , E.R. , North , S.c. and Vo , K.P. (1988) DAG - a program that draws directed graphs. Software Practice and Experience , 18(11), 1047–1062
   Web of Science ®Google Scholar
• Garey , M.R. and Johnson , D.S. ( 1983 ) Crossing number is NP-complete. SIAM Journal of Algebraic and Discrete Method , 4 ( 3 ), 312 – 316 .
   Web of Science ®Google Scholar
• Glover . F. and Laguna , M. ( 1997 ) Tabu Search , Kluwer Academic Publishers, Boston , MA .
   Google Scholar
• Junger , M. and Mutzel , P. ( 1995 ) Exact and heuristic algorithms for 2layer straight line crossing minimization. Lecture Notes in Computer Science. Graph Drawing 95 , Franz J. Brandenburg (ed.), Springer Verlag, Berlin , pp. 337 – 348 .
   Google Scholar
• Laguna , M. and Marti , M. ( 1999 ) GRASP and path relinking for 2layer straight line crossing minimization. INFORMS Journal on Computing , 11 ( 1 ), 44 – 52 .
   Web of Science ®Google Scholar
• Laguna M. , Marti , R. and Valls , V. ( 1997 ) Arc crossing minimization in hierarchical digraphs with tabu search. Compupers and Operations Research , 24 ( 12), 1175 – 1186 .
   Web of Science ®Google Scholar
• Makinen , E. ( 1990 ) Experiments on drawing 2–level hierarchical graphs. International Journal Computer Mathematics , 36 , 175 – 181 .
   Web of Science ®Google Scholar
• Marti , R. ( 1998 ) A Tabu Search Algorithm for the bipartite drawing problem. European Journal ofOperational Research , 106 , 558 – 569 .
   Web of Science ®Google Scholar
• Marti , R. and Laguna , M. ( 1997 ) Heuristics and metaheuristics for 2layer straight line crossing minimization. Working paper, University of Valencia, Spain. ,
   Google Scholar
• Sugiyama , K. , Tagawa , S. and Toda , M. ( 1981 ) Methods for visual understanding of hierarchical system structures. IEEE Transactions on Systems, Man, and Cybernetics, SMC-11 ( 2 ), 109 – 125 .
   Web of Science ®Google Scholar
• Valls , V. Marti , R. and Lino , P. ( 1996 a) A branch and bound algorithm for arc crossing minimization in bipartite graphs. European Journal of Operational Research , 90 , 303 – 319 .
   Web of Science ®Google Scholar
• Valls , V. , Marti , R. and Lino , P. ( 1996 b) A tabu thresholding algorithm for arc crossing minimization in bipartite graphs. Annals of Operations Research , 63 , 233 – 251 .
   Web of Science ®Google Scholar