A new algorithm for stable assignments
暂无分享,去创建一个
A new algorithm for solving stable assignment problems is presented. By using a weight table, the overall situation of a problem is considered. The algorithm can deal with not only the one-to-one type assignments but also multi-function assignments for both equal and unequal sets. Some examples are given to illustrate the algorithm.
[1] Shu-Park Chan,et al. An approach for multi-function assignment , 1989, Twenty-Third Asilomar Conference on Signals, Systems and Computers, 1989..
[2] L. B. Wilson,et al. Stable marriage assignment for unequal sets , 1970 .
[3] N. D. Francis. The stability of marriage and university admissions—zero-one programming method , 1987 .
[4] L. B. Wilson,et al. The stable marriage problem , 1971, Commun. ACM.
[5] L. Shapley,et al. College Admissions and the Stability of Marriage , 1962 .