2012年6月
A minimum violations ranking method
OPTIMIZATION AND ENGINEERING
- ,
- ,
- 巻
- 13
- 号
- 2
- 開始ページ
- 349
- 終了ページ
- 370
- 記述言語
- 英語
- 掲載種別
- 研究論文(学術雑誌)
- DOI
- 10.1007/s11081-011-9135-5
- 出版者・発行元
- SPRINGER
We present a rating method that, given information on the pairwise comparisons of items, minimizes the number of inconsistencies in the ranking of those items. Our Minimum Violations Ranking (MVR) Method uses a binary linear integer program (BILP) to do this. We prove conditions when the relaxed LP will give an optimal solution to the original BILP. In addition, the LP solution gives information about ties and sensitivities in the ranking. Lastly, our MVR method makes use of bounding and constraint relaxation techniques to produce a fast algorithm for the linear ordering problem, solving an instance with about one thousand items in less than 10 minutes.
- リンク情報
- ID情報
-
- DOI : 10.1007/s11081-011-9135-5
- ISSN : 1389-4420
- Web of Science ID : WOS:000304146200008