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

  1. Valls, V.
  2. Martí, R.
  3. Lino, P.
Revue:
European Journal of Operational Research

ISSN: 0377-2217

Année de publication: 1996

Volumen: 90

Número: 2

Pages: 303-319

Type: Article

DOI: 10.1016/0377-2217(95)00356-8 GOOGLE SCHOLAR
La source de données: Scopus