請用此 Handle URI 來引用此文件：
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/51414| 標題: | 尋找直線上的多數決組合 Finding Condorcet Winner Configurations on a Real Line |
| 作者: | PO-TING LIN 林柏廷 |
| 指導教授: | 趙坤茂 |
| 關鍵字: | 設施設置問題,多數決,最佳化,演算法, facility location problem,majority voting,optimization,algorithms, |
| 出版年 : | 2016 |
| 學位: | 碩士 |
| 摘要: | In 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. |
| URI: | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/51414 |
| 全文授權: | 有償授權 |
| 顯示於系所單位： | 資訊工程學系 |
文件中的檔案：
| 檔案 | 大小 | 格式 | |
|---|---|---|---|
| ntu-105-1.pdf 未授權公開取用 | 619.62 kB | Adobe PDF |
系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。