Complexity and in-approximability of a selection problem in robust optimization (Q385465): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+C47
@@ Property / Mathematics Subject Classification ID: 90C47 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q17
@@ Property / Mathematics Subject Classification ID: 68Q17 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+F35
@@ Property / Mathematics Subject Classification ID: 62F35 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C27
@@ Property / Mathematics Subject Classification ID: 90C27 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C39
@@ Property / Mathematics Subject Classification ID: 90C39 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6235151
@@ Property / zbMATH DE Number: 6235151 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+combinatorial optimization
@@ Property / zbMATH Keywords: combinatorial optimization / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+computational complexity
@@ Property / zbMATH Keywords: computational complexity / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+robust optimization
@@ Property / zbMATH Keywords: robust optimization / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+NP-hardness
@@ Property / zbMATH Keywords: NP-hardness / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+inapproximability
@@ Property / zbMATH Keywords: inapproximability / rank @@
+Normal rank

Revision as of 12:45, 29 June 2023