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

@article{Laguna1999GRASPAP,
  title={GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization},
  author={Manuel Laguna and Rafael Mart{\'i}},
  journal={INFORMS Journal on Computing},
  year={1999},
  volume={11},
  pages={44-52}
}
In this paper, we develop a greedy randomized adaptive search procedure (GRASP) for the problem of minimizing straight-line crossings in a 2-layer graph. The procedure is fast and is particularly appealing when dealing with low-density graphs. When a modest increase in computational time is allowed, the procedure may be coupled with a path relinking… CONTINUE READING