关于有能力限制的指派问题的一点注记

A Not of the Constrained Assignment Problem

首先讨论了有能力限制的不平衡指派问题的转化和最优性,并提出了采用最小费用最大流的方法求解该问题.

First, it will discuss how to transit the problem into the assignment problem in inequality of workers and jobs, and optimization. Second, the methods of min-cost flow may be used directly to the problem.