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

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

ISSN: 0377-2217

Year of publication: 1996

Volume: 90

Issue: 2

Pages: 303-319

Type: Article

DOI: 10.1016/0377-2217(95)00356-8 GOOGLE SCHOLAR
Data source: Scopus