GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization

References

• Anonymous Referee “Referee report #1.”. (1998) Google Scholar
• Carpano M. J. Automatic display of hierarchized graphs for computer aided decision analysis. IEEE Trans. Systems, Man, and Cybernetics (1980) 10:705–715Crossref, Google Scholar
• Catarci T. The assignment heuristic for crossing reduction. IEEE Trans. Systems, Man, and Cybernetics (1995) 25:515–520Crossref, Google Scholar
• Eades P., Kelly D. Heuristics for drawing 2-layered networks. Ars Combinatoria (1986) 21:89–98Google Scholar
• Eades P., Lin X., Tamassia R. An algorithm for drawing a hierarchical graph. Proc. Second Canadian Conf. Comput. Geometry (1994) University of Otawa:1–18Google Scholar
• Eades P., Wormald N. C. The median heuristic for drawing 2-layered networks. (1986) . Technical report 69, Department of Computer Science, University of Queensland, AustraliaGoogle Scholar
• Feo T., Resende M. G. C. A probabilistic heuristic for a computationally difficult set covering problem. Oper. Res. Lett. (1989) 8:67–71Crossref, Google Scholar
• Feo T., Resende M. G. C. Greedy randomized adaptive search procedures. J. Global Optim. (1995) 2:1–27Google Scholar
• Fleurent C., Glover F. Improved constructive multistart strategies for the quadratic assignment problem using adaptive memory. (1997) (University of Colorado, Boulder) Google Scholar
• Gansner E. R., Koutsofios E., North S. C., Vo K. P. A technique for drawing directed graphs. IEEE Trans. Software Engrg. (1993) 19:214–230Crossref, Google Scholar
• Glover F., Laguna M.Tabu Search (1997) (Kluwer Academic Publishers, Boston) Crossref, Google Scholar
• Jünger M., Mutzel P. 2-Layer straight line crossing minimization: Performance of exact and heuristic algorithms. J. Graph Algorithms and Appl. (1997) 1:1–25Crossref, Google Scholar
• Knuth D. E.The Stanford GraphBase: A Platform for Combinatorial Computing (1993) (Addison Wesley, New York) Google Scholar
• Laguna M., Martí R., Valls V. Arc crossing minimization in hierarchical digraphs with tabu search. Comput. Oper. Res. (1997) 24:1175–1186Crossref, Google Scholar
• Makinen E. Experiments on drawing 2-level hierarchical graphs. Internat. J. Comput. Math. (1990) 36:175–182Crossref, Google Scholar
• Martí R. A tabu search algorithm for the bipartite drawing problem. Eur. J. Oper. Res. (1998) 106:558–569Crossref, Google Scholar
• Martí R., Laguna M. Heuristics and metaheuristics for 2-layer straight line crossing minimization. (1997) . Working paper, University of Valencia, SpainGoogle Scholar
• Resende M. G. C., Ribeiro C. C. A GRASP for graph planarization. Networks (1997) 29:173–189Crossref, Google Scholar
• Rowe L. A., Davis M., Messinger E., Meyer C., Spirakis C., Tuan A. A browser for directed graphs. Software Practice and Experience (1987) 17:61–76Crossref, Google Scholar
• Sugiyama K. A cognitive approach for graph drawing. Cybernetics and Systems: An Internat. J. (1987) 18:447–488Crossref, Google Scholar
• Sugiyama K., Tagawa S., Toda M. Methods for visual understanding of hierarchical system structures. IEEE Trans. Systems, Man, and Cybernetics (1981) 11:109–125Crossref, Google Scholar
• Valls V., Martí R., Lino P. A branch and bound algorithm for arc crossing minimization in bipartite graphs. Eur. J. Oper. Res. (1996) 90:303–319Crossref, Google Scholar
• Valls V., Martí R., Lino P. A tabu thresholding algorithm for arc crossing minimization in bipartite graphs. Ann. Oper. Res. (1996) 63:233–251Crossref, Google Scholar
• Wilson R. J.Introduction to Graph Theory (1972) (Academic Press, New York) Google Scholar