Algorithms constructing a representive vector criterion for a binary preference relation (Q1343006): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Formation of a vector criterion on the basis of a binary preference relation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3659774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of posets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4144192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3944006 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3904047 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition theorem for partially ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298219 / rank
 
Normal rank

Revision as of 11:29, 23 May 2024

scientific article
Language Label Description Also known as
English
Algorithms constructing a representive vector criterion for a binary preference relation
scientific article

    Statements

    Algorithms constructing a representive vector criterion for a binary preference relation (English)
    0 references
    0 references
    0 references
    16 January 1995
    0 references
    0 references