| Article ID: | iaor20023445 |
| Country: | China |
| Volume: | 20 |
| Issue: | 2 |
| Start Page Number: | 18 |
| End Page Number: | 20 |
| Publication Date: | Jun 2001 |
| Journal: | Journal of Shandong University of Science and Technology |
| Authors: | Zhao Maoxian, Wan Xianmei, Huang Zhen |
In this paper, we discuss a one dimensional resource-allocation problem and propose a new method for solving it by dividing it into several assignment problems. Solving the corresponding assignment problems by means of the Hungarian algorithm, we obtained the optimal solution of the resource-allocation problem.