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

@@ Property / cites work @@
+Formation of a vector criterion on the basis of a binary preference relation
+Normal rank
@@ Property / cites work @@
+Q3659774
@@ Property / cites work: Q3659774 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of posets
@@ Property / cites work: On the complexity of posets / rank @@
+Normal rank
@@ Property / cites work @@
+Q4091421
@@ Property / cites work: Q4091421 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4144192
@@ Property / cites work: Q4144192 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3944006
@@ Property / cites work: Q3944006 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3904047
@@ Property / cites work: Q3904047 / rank @@
+Normal rank
@@ Property / cites work @@
+A decomposition theorem for partially ordered sets
+Normal rank
@@ Property / cites work @@
+Q3292914
@@ Property / cites work: Q3292914 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4298219
@@ Property / cites work: Q4298219 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf01128292
+Normal rank
@@ Property / OpenAlex ID @@
+W2071877442
@@ Property / OpenAlex ID: W2071877442 / rank @@
+Normal rank