電機資訊學院: 資訊工程學研究所指導教授: 趙坤茂林柏廷LIN, PO-TINGPO-TINGLIN2017-03-032018-07-052017-03-032018-07-052016http://ntur.lib.ntu.edu.tw//handle/246246/275372In this thesis, we study the problem of locating k facilities under major voting criterion when all the voters are distributed along a real line. An optimal solution to this problem is called a Condorcet winner configuration. Given a placement of k facilities, there exists a fast algorithm to verify whether it is an optimal solution or not [8]. We have found a missing in this algorithm and filled the missing. According to this algorithm and our newly research results, we propose an algorithm for finding an optimal solution. If k is a fixed value, then our algorithm runs in linear time.634488 bytesapplication/pdf論文公開時間: 2018/3/8論文使用權限: 同意有償授權(權利金給回饋學校)設施設置問題多數決最佳化演算法facility location problemmajority votingoptimizationalgorithmsthesishttp://ntur.lib.ntu.edu.tw/bitstream/246246/275372/1/ntu-105-R02922067-1.pdf