@article{oai:tou.repo.nii.ac.jp:00000052,
 author = {嘉村 , 友作 and Kamura, Yuusaku},
 issue = {2},
 journal = {東京通信大学紀要, Journal of Tokyo Online University},
 month = {Mar},
 note = {In this study, we deal with the bottleneck assignment problem in vector case. This problem is NP-complete. We show an idea that we use a clustering method to divide the original problem into sub problems. Each set of vertices is divided to subsets by a non-hierarchical clustering method. We make the optimal combination of the subsets, then vertices in the subset are corresponded according to the subsets’ combinations. We show the effect of this idea by the numerical experiments.},
 pages = {69--74},
 title = {The Modified Bottleneck Assignment Problem in Vector Case ―An Idea to Apply a Clustering Method―},
 year = {2020},
 yomi = {カムラ , ユウサク}
}