A tabu thresholding algorithm for arc crossing minimization in bipartite graphs

Annals of Operations Research

Volumn 63, Issue , 1996, Pages 233-251

  Valls, Vicente ^a   Martí, Rafael ^a   Lino, Pilar ^a  

^a UNIVERSITY OF VALENCIA   (Spain)

Author keywords

Arc crossing minimization; Automatic graph drawing; Heuristics; Tabu search; Tabu thresholding

Indexed keywords

EID: 21344472614     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/BF02125456     Document Type: Article

References (19)

1. M.J. Carpano, Automatic display of hierarchized graphs for computer aided decision analysis, IEEE Trans. Syst., Man, Cybern. SMC-10(1980)705.
2. D. de Werra and A. Hertz, Tabu search techniques: A tutorial and an application to neural networks, OR Spectrum 11(1989)132.
3. P. Eades and D. Kelly, Heuristics for drawing 2-layered networks, Ars Combinatoria 21(1986)89.
4. P. Eades, B. McKay and N.C. Wormald, An NP-complete crossing number problem for bipartite graphs, Working Paper, Department of Computer Science, University of Queensland, Australia (1985).
5. P. Eades and N.C. Wormald, The median heuristic for drawing 2-layered networks, Working Paper, Department of Computer Science, University of Queensland, Australia (1986).
6. F. Glover, Future paths for integer programming and links to artificial intelligence, Comp. Oper. Res. 13(1986)533.
7. F. Glover, Tabu search: Part I, ORSA J. Comp. 1(1989)190.
8. F. Glover, Tabu search: Part II, ORSA J. Comp. 2(1990)4.
9. F. Glover, Simple tabu thresholding in optimization, Working Paper, School of Business, University of Colorado, Boulder (1992).
10. F. Glover and M. Laguna, Tabu search, in: Modem Heuristic Techniques for Combinatorial Problems, ed. C.R. Reeves (Blackwell Scientific, Oxford, UK, 1993).
11. F. Glover, D. Karney, D. Klingman and A. Napier, A computational study on start procedures, basis change criteria and solution algorithms for transportation problems, Manag. Sci. 20(1974)793.
12. M. Hasan and I.H. Osman, Local search algorithms for the weighted maximal planar layout problem, Int. Trans. Oper. Res. 1 (1994).
13. A. Hertz and D. de Werra, The tabu search metaheuristic: How we used it, Ann. Math. Art. Int. 1(1991)111.
14. D.S. Johnson, The NP-completeness column: An ongoing guide, J. Algor. 3(1982)97.
15. R. Martí, Técnicas exactas y heurísticas en el diseño automático de redes de plantificación de proyectos, Ph.D. Thesis, Department of Statistics and Operations Research, University of Valencia, Spain (1993).
16. J. Smith and J. Linders, Automatic generation of logic diagrams, in: IEEE Proc. 13th Design Automation Conf., No. 76 (1976) chap. 1098-3c, p. 377.
17. K. Sugiyama, S. Tagawa and M. Toda, Methods for visual understanding of hierarchical system structures, IEEE Trans. Syst., Man, Cybern. SMC-11(1981)109.
18. R. Tamassia, G. Di Battista and C. Batini, Automatic graph drawing and readability of diagrams, IEEE Trans. Syst., Man, Cybern. SMC-18(1988)61.
19. J.N. Warfield, Crossing theory and hierarchy mapping, IEEE Trans. Syst., Man, Cybern. SMC-7(1977)505.