A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs
scientific article; zbMATH DE number 1208480