提出了指派问题的2种推广模型:双限制性指派问题和缺省限制性指派问题,首先设计了双限制性指派问题2种多项式算法,随后设计出了缺省限制性指派问题的1种多项式算法,并且分别对以上算法的正确性和时间复杂性做出了相应的证明.
Two general kinds of corstrained assignment problem are given,called as the double-constrained assignment problem and the absent-constrained assignment problem,respectively.First of all,two polynomial time algorithms are designed for the first problem,and one polynomial-time algorithm is provided for the second problem.Finally,the validity and the complexity are proved for these three algorithms.