@article{oai:tsukuba.repo.nii.ac.jp:00027430,
 author = {山本, 芳嗣 and Pedings, Kathryn E. and Langville, Amy N. and Yamamoto, Yoshitsugu},
 issue = {2},
 journal = {Optimization and engineering},
 month = {Jun},
 note = {We present a rating method that, given information on the pairwise comparisons of n 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.},
 pages = {349--370},
 title = {A minimum violations ranking method},
 volume = {13},
 year = {2012}
}