A branch and bound algorithm to construct a consensus ranking based on Kendall’s T
Download full text from publisher
More about this item
KeywordsGroup decision support; Rankcorrelation; Kendall’s ?; Branch and bound algorithm;
NEP fieldsThis paper has been announced in the following NEP Reports:
- NEP-ALL-2006-02-26 (All new papers)
StatisticsAccess and download statistics
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ant:wpaper:2005030. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Joeri Nys). General contact details of provider: http://edirc.repec.org/data/ftufsbe.html .
We have no references for this item. You can help adding them by using this form .