An exact algorithm for the multicriteria ordered clustering problem
AbstractIn the context of multicriteria decision aid, we address the problem of regrouping alternatives into completely ordered categories based on valued preference degrees. We assume that the number of groups is fixed a priori. This will be referred to as the multicriteria ordered clustering problem. The model is based on the definition of an inconsistency matrix and only uses the ordinal properties of the pairwise preference relations. An exact algorithm is proposed to find the ordered partition and is applied as illustration to the Human Development Index.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Elsevier in its journal Omega.
Volume (Year): 40 (2012)
Issue (Month): 6 ()
Contact details of provider:
Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral 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: (Zhang, Lei).
If references are entirely missing, you can add them using this form.