The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance (Q320084): Difference between revisions

@@ Property / author @@
+André B. Chassein
@@ Property / author: André B. Chassein / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C27
@@ Property / Mathematics Subject Classification ID: 90C27 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+B80
@@ Property / Mathematics Subject Classification ID: 90B80 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6633792
@@ Property / zbMATH DE Number: 6633792 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+ordered median
@@ Property / zbMATH Keywords: ordered median / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+inverse optimization problem
@@ Property / zbMATH Keywords: inverse optimization problem / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+convex
@@ Property / zbMATH Keywords: convex / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+tree
@@ Property / zbMATH Keywords: tree / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+Chebyshev norm
@@ Property / zbMATH Keywords: Chebyshev norm / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+Hamming distance
@@ Property / zbMATH Keywords: Hamming distance / rank @@
+Normal rank

Revision as of 01:46, 28 June 2023