On the Assigning Problem in Operation Research
天骁 赵 · Advances in Applied Mathematics · 2016
详细给出指派问题的定性刻化，同时提供一个可行算法，有效计算指派问题的最优解。在日常生活中会遇到类似的问题，需要用指派问题进行解决，使得完成任务的总效率最高，就需要用指派问题进行解决。由于是0-1问题，所以总能求的相对最优解。 In this paper, we characterize the assigning problem and present an algorithm to compute the op-timal solutions efficiently. In our everyday life, such problems are always needed to use assigning methods to give a good solution. Since they are 0-1 problem, we may find relative optimal solutions.