Heuristics and meta-heuristics for 2-layer straight line crossing minimization

Discrete Applied Mathematics

Volumn 127, Issue 3, 2003, Pages 665-678

  Martí, Rafael ^a   Laguna, Manuel ^b  

^a UNIVERSITY OF VALENCIA   (Spain)

^b UNIVERSITY OF COLORADO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84867999313     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(02)00397-9     Document Type: Article

References (21)

1. M.J. Carpano Automatic display of hierarchized graphs for computer aided decision analysis IEEE Trans. Systems Man Cybernetics 10 11 1980 705 715
2. M. Dell'Amico, F. Maffioli, A new tabu search approach to the 0-1 equicut problem, in: I.H. Osman, J.P. Kelly (Eds.), Metaheuristics: Theory and Applications, 1996, pp. 361-377.
3. P. Eades, and D. Kelly Heuristics for drawing 2-layered networks Ars Combin 21 1986 89 98
4. P. Eades, N.C. Wormald, The median heuristic for drawing 2-layered networks, Technical Report 69, Department of Computer Science, University of Queensland, 1986.
5. P. Eades, and N.C. Wormald Edge crossing in drawings of bipartite graphs Algorithmica 11 1994 379 403
6. T. Feo, and M.G.C. Resende A probabilistic heuristic for a computationally difficult set covering problem Oper. Res. Lett 8 1989 67 71
7. T. Feo, and M.G.C. Resende Greedy randomized adaptive search procedures J. Global Optimization 2 1995 127
8. E.R. Gansner, E. Koutsofios, S.C. North, and K.P. Vo A technique for drawing directed graphs IEEE Trans. Software Eng 19 3 1993 214 230
9. E.R. Gansner, S.C. North, and K.P. Vo DAG - a program that draws directed graphs Software Practice Experience 18 11 1988 1047 1062
10. F. Glover, and M. Laguna Tabu Search 1997 Kluwer Academic Publishers Boston
11. D.S. Johnson The NP-completeness column an ongoing guide J. Algorithms 3 1982 288 300
12. M. Jünger, P. Mutzel, Exact and Heuristic Algorithms for 2-Layer Straight Line Crossing Minimization, Lecture Notes in Computer Science, Graph Drawing 95, Springer, Berlin, 1995, pp. 337-348.
13. D.E. Knuth The Stanford GraphBase: A Platform for Combinatorial Computing 1993 Addison-Wesley New York
14. M. Laguna, T.A. Feo, and H.C. Elrod A greedy randomized adaptive search procedure for the two-partition problem Oper. Res 42 4 1994 677 687
15. M. Laguna, and R. Mart GRASP and path relinking for 2-layer straight line crossing minimization INFORMS J. Comput 11 1 1999 44 52
16. M. Laguna, R. Mart, and V. Valls Arc crossing minimization in hierarchical digraphs with tabu search Comput. Oper. Res 24 12 1997 1175 1186
17. E. Makinen Experiments on drawing 2-level hierarchical graphs Internat. J. Comput. Math 36 1990 175 182
18. R. Mart A tabu search algorithm for the bipartite drawing problem Eur. J. Oper. Res 106 1998 558 569
19. K. Sugiyama, S. Tagawa, and M. Toda Methods for visual understanding of hierarchical system structures IEEE Trans. Systems Man Cybernet 11 2 1981 109 125
20. V. Valls, R. Mart, and P. Lino A tabu thresholding algorithm for arc crossing minimization in bipartite graphs Ann. Oper. Res 63 1996 233 251
21. V. Valls, R. Mart, and P. Lino A branch and bound algorithm for arc crossing minimization in bipartite graphs Eur. J. Oper. Res 90 1996 303 319