An exact algorithm for the multicriteria ordered clustering problem
In 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.
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|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|
When requesting a correction, please mention this item's handle: RePEc:eee:jomega:v:40:y:2012:i:6:p:861-869. See general information about how to correct material in RePEc.
If references are entirely missing, you can add them using this form.