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

@@ Property / Mathematics Subject Classification ID @@
+C27
@@ Property / Mathematics Subject Classification ID: 90C27 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+B35
@@ Property / Mathematics Subject Classification ID: 90B35 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+W25
@@ Property / Mathematics Subject Classification ID: 68W25 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C60
@@ Property / Mathematics Subject Classification ID: 90C60 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6066855
@@ Property / zbMATH DE Number: 6066855 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+combinatorial optimization
@@ Property / zbMATH Keywords: combinatorial optimization / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+quadratic knapsack
@@ Property / zbMATH Keywords: quadratic knapsack / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+FPTAS
@@ Property / zbMATH Keywords: FPTAS / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+strongly polynomial time
@@ Property / zbMATH Keywords: strongly polynomial time / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+machine scheduling
@@ Property / zbMATH Keywords: machine scheduling / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ejor.2011.10.049
+Normal rank
@@ Property / OpenAlex ID @@
+W2020203251
@@ Property / OpenAlex ID: W2020203251 / rank @@
+Normal rank
@@ 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
@@ links / mardi / name / links / mardi / name @@
+Publication:439504