A strongly polynomial FPTAS for the symmetric quadratic knapsack problem (Q439504): Difference between revisions

@@ Property / cites work @@
+An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure
+Normal rank
@@ Property / cites work @@
+A single-item economic lot-sizing problem with a non-uniform resource: Approximation
+Normal rank
@@ Property / cites work @@
+Positive half-products and scheduling with controllable processing times
+Normal rank
@@ Property / cites work @@
+MINIMIZING TOTAL WEIGHTED EARLINESS-TARDINESS ON A SINGLE MACHINE AROUND A SMALL COMMON DUE DATE: AN FPTAS USING QUADRATIC KNAPSACK
+Normal rank
@@ Property / cites work @@
+Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Theory and algorithms.
+Normal rank
@@ Property / cites work @@
+A faster fully polynomial approximation scheme for the single-machine total tardiness problem
+Normal rank
@@ Property / cites work @@
+Improving the complexities of approximation algorithms for optimization problems
+Normal rank
@@ Property / cites work @@
+Capacitated two-parallel machines scheduling to minimize sum of job completion times
+Normal rank
@@ Property / cites work @@
+Batching and scheduling in a multi-machine flow shop
+Normal rank
@@ Property / cites work @@
+An FPTAS for a supply scheduling problem with non-monotone cost functions
+Normal rank
@@ Property / cites work @@
+A simple FPTAS for a single-item capacitated economic lot-sizing problem with a monotone cost structure
+Normal rank
@@ Property / cites work @@
+Q3525910
@@ Property / cites work: Q3525910 / rank @@
+Normal rank
@@ Property / cites work @@
+Preemptive scheduling with availability constraints to minimize total weighted completion times
+Normal rank