Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Hi-index | 0.00 |
Proposed was an approach enabling one to reduce studies of the properties of ordinal relations for criteria with an arbitrary (including finite) set of values to similar problems for relations defined over the entire n-dimensional real space Rn. It enabled one to prove that all main findings, methods, and algorithms obtained previously for the ordinal relations on Rn can be extended in arbitrary criterial spaces to the ordinal relations with the criterion scale cardinalities not less than three.