An algorithm for then×n optimum assignment problem |
| |
| Authors: | Kabekode V. S. Bhat Bharat Kinariwala |
| |
| Affiliation: | (1) Department of Computer Science and Engineering, Shiraz University, Shiraz, Iran;(2) Department of Electrical Engineering, University of Hawaii, 96822 Honolulu, Hawaii |
| |
| Abstract: | ![]()
In this paper we present an algorithm for finding an optimum assignment for ann×n matrixM inn iterations. The method uses systematic permutations on the rows ofM and is based on the properties of optimum assignments. The implementation presented in the paper requires at mostO(n3) in time andn2+6n memory locations for solving a densen×n problem.This work was supported by the National Science Foundation Grant NSF ENG 74-19788. |
| |
| Keywords: | Algorithm assignment permutation cycles cost |
| 本文献已被 SpringerLink 等数据库收录！ |
