Login / Signup

The uniquely solvable bipartite matching problem.

Katarína Cechlárová
Published in: Oper. Res. Lett. (1991)
Keyphrases
  • bipartite matching
  • maximum weight
  • np complete
  • np hard
  • special case
  • minimum cost flow
  • computational complexity
  • scheduling problem