1996

1. A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs

   European Journal of Operational Research, Vol. 90, Núm. 2, pp. 303-319

2. A heuristic algorithm for project scheduling with splitting allowed

   Journal of Heuristics, Vol. 2, Núm. 1, pp. 87-104

3. A tabu thresholding algorithm for arc crossing minimization in bipartite graphs

   Annals of Operations Research, Vol. 63, pp. 233-251