The k-cardinality assignment (k-assignment, for short) problem asks for finding a minimal (maximal) weight of a matching of cardinality k in a weighted bipartite graph K n , n , k ≤ n . Here we are interested in computing the sequence of all k-assignm... ...

请注册登录后继续浏览