TY - GEN
T1 - A new method to solve the bottleneck assignment problem
AU - Cai, Xuewei
AU - Shi, Haobin
AU - Hwang, Kao Shing
AU - Wang, Shixiong
AU - Chen, Huahui
AU - Li, Xuesi
AU - Cui, Hongwei
N1 - Publisher Copyright:
© 2016 IEEE.
PY - 2016/8/16
Y1 - 2016/8/16
N2 - Being directed against the bottleneck assignment problem in operational research, a new method called Matrix Elimination Method based on cost matrix transformation is proposed, and an example analysis is used to prove the validity of the algorithm and the resolution is optimal substructure, moreover, the method is illustrated more efficient than other methods by comparison.
AB - Being directed against the bottleneck assignment problem in operational research, a new method called Matrix Elimination Method based on cost matrix transformation is proposed, and an example analysis is used to prove the validity of the algorithm and the resolution is optimal substructure, moreover, the method is illustrated more efficient than other methods by comparison.
KW - Bottleneck assignment problem
KW - Cost matrix
KW - Matrix Elimination Method
KW - Operational Research
KW - Optimal substructure
UR - https://www.scopus.com/pages/publications/84986220571
U2 - 10.1109/IS3C.2016.124
DO - 10.1109/IS3C.2016.124
M3 - 会议稿件
AN - SCOPUS:84986220571
T3 - Proceedings - 2016 IEEE International Symposium on Computer, Consumer and Control, IS3C 2016
SP - 471
EP - 474
BT - Proceedings - 2016 IEEE International Symposium on Computer, Consumer and Control, IS3C 2016
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2016 IEEE International Symposium on Computer, Consumer and Control, IS3C 2016
Y2 - 4 July 2016 through 6 July 2016
ER -