Fast approximation schemes for Boolean programming and scheduling problems related to positive convex half-product (Q257209): Difference between revisions

@@ Property / author @@
+Vitaly A. Strusevich
@@ Property / author: Vitaly A. Strusevich / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C09
@@ Property / Mathematics Subject Classification ID: 90C09 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+B35
@@ Property / Mathematics Subject Classification ID: 90B35 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6555670
@@ Property / zbMATH DE Number: 6555670 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+scheduling
@@ Property / zbMATH Keywords: scheduling / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+half-product
@@ Property / zbMATH Keywords: half-product / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+quadratic knapsack
@@ Property / zbMATH Keywords: quadratic knapsack / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+scheduling with rejection
@@ Property / zbMATH Keywords: scheduling with rejection / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+scheduling with controllable processing times
+Normal rank
@@ Property / zbMATH Keywords @@
+FPTAS
@@ Property / zbMATH Keywords: FPTAS / rank @@
+Normal rank

Revision as of 12:36, 27 June 2023