Arc crossing minimization in hierarchical digraphs with tabu search

Computers and Operations Research

Volumn 24, Issue 12, 1997, Pages 1175-1186

  Laguna, Manuel ^a   Martí, Rafael ^b   Valls, Vicente ^b  

^a UNIVERSITY OF COLORADO   (United States)

^b UNIVERSITY OF VALENCIA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; HIERARCHICAL SYSTEMS; PROBLEM SOLVING; STATISTICAL METHODS;

ARC CROSSING MINIMIZATION; HIERARCHICAL DIGRAPHS; TABU SEARCH;

DRAWING (GRAPHICS);

EID: 0031376020     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(96)00083-4     Document Type: Article

References (26)

1. Di Battista, G. D., Eades, P., Tamassia, R. and Tollis, I. G., Algorithms for Drawing Graphs: an Annotated Bibliography. Department of Computer Science, Brown University, 1994.
2. Warfield, J., Crossing theory and hierarchy mapping . IEEE Transactions on Systems, Man and Cybernetics , 1977, SMC-7, 7 505-523.
3. Carpano, M-J., Automatic display of hierarchized graphs for computer-aided decision analysis . IEEE Transactions on Systems, Man and Cybernetics , 1980, SMC-10, 11 705-715.
4. Garey, M. R. and Johnson, D. S., Crossing number is np-complete,. SIAM Journal of Algebraic and Discrete Methods, 1983, 4, 3 312-316.
5. Delarche, M., Quelques outils infographiques pou l'analyse structurale de systemes. Dr Ing, Thesis, University of Grenoble, 1979.
6. Eades, P. and Kelly, D., Heuristics for drawing 2-layered networks. ARS Combinatoria, 1986, 21-A, 89-98.
7. Eades, P. and Wormald, N. C., The median heuristic for drawing two-layered networks. Technical Report 69, Department of Computer Science, University of Queensland, 1986.
8. Valls, V., Martí, R. and Lino, P., A tabu thresholding algorithm for arc crossing minimization in bipartite graphs. Annals of Operations Research 1995, 60.
9. Marti, R., An aggressive search procedure for the bipartite drawing problem. Proceedings of Metaheuristics International Conference 1995, Breckenridge, CO (to appear).
10. Glover, F., Heuristics for integer programming using surrogate constraints. Decision Science , 1977, 8, 156-166.
11. Marti, R., The bipartite drawing problem. Technical Report, Departamento de Estadistica e Investigacion Operativa, Universidad de Valencia, Spain, 1995.
12. Makinen, E., Experiments on drawing 2-level hierarchical graphs. International Journal of Computer Mathematics, 1990, 36, 175-181.
13. Sugiyama, K., Tagawa, S. and Toda, M., Methods for visual understanding of hierarchical system structures . IEEE Transactions on Systems, Man and Cybernetics , 1981, SMC-11, 2 109-125.
14. Rowe, L. A., Davis, M., Messinger, E., Meyer, C., Spirakis, C. and Tuan, A., A browser for directed graphs. Software - Practice and Experience, 1987, 17, 1 61-76.
15. Gansner, E. R., North, S. C. and Vo, K. P., DAG - A program that draws directed graphs. Software - Practice and Experience 1988, 18(11), 1047-1062.
16. Tamassia, R., Battista, G. D. and Batini, C., Automatic graph drawing and readability of diagrams. IEEE Transactions on Systems, Man and Cybernetics, 1988, 18, 1 61-79.
17. Eades, P. and Lin, X., How to draw a directed graph. Proceedings of IEEE Workshop on Visual Languages (VL'89) 1989, 13-17.
18. Eades, P. and Sugiyama, K., How to draw a directed graph. Journal of Information Processing , 1990, 13, 4 424-437.
19. Tutte, W., How to draw a graph. Proceedings of the London Mathematical Society 1963, 3(13), 743-768.
20. Eades, P., Lin, X. and Tamassia, R. An algorithm for drawing a hierarchical graph. Proceedings of the Second Canadian Conference on Computational Geometry 1990, 142-146.
21. Gansner, E. R., Koutsofios, E., North, S. C. and Vo, K. P., A technique for drawing directed graphs. IEEE Transactions on Software Engineering, 1993, 19, 3 214-230.
22. Valls, V., Martí, R. and Lino, P. A branch and bound algorithm for arc crossing minimization in bipartite graphs. European Journal of Operational Research, 1996, 90, 303-319.
23. Glover, F., Tabu Search - Part I. ORSA Journal on Computing , 1989, 1, 3 190-206.
24. Glover, F., Laguna, M., Taillard, E., de Werra, D., Tabu Search. Annals of Operations Research 1993, 41.
25. Glover, F. and Laguna, M., Tabu Search. In Modern Heuristic Techniques for Combinatorial Problems, ed. C. R. Reeves. Blackwell Scientific Publications, Oxford, 1993, pp. 70-150.
26. Laguna, M., A guide to implementing tabu search. Investigacion Operativa, 1994, 4, 1 5-25.