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

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

ISSN: 0377-2217

Argitalpen urtea: 1996

Alea: 90

Zenbakia: 2

Orrialdeak: 303-319

Mota: Artikulua

DOI: 10.1016/0377-2217(95)00356-8 GOOGLE SCHOLAR
Datuen iturria: Scopus