| Article ID: | iaor20021409 |
| Country: | China |
| Volume: | 32 |
| Issue: | 4 |
| Start Page Number: | 10 |
| End Page Number: | 13 |
| Publication Date: | Dec 2000 |
| Journal: | Journal of Zhengzhou University |
| Authors: | Yang Aifeng |
| Keywords: | networks: flow |
From the graph-theoretic point of view, the optimal assignment problem with choice strategy is transformed to a bipartite k-matching problem, and its two basic models of min–max and min–sum are investigated by using maximum matching and min–cost flow. Finally, the complexity of the algorithms is analysed.