Approximation schemes for \(r\)-weighted minimization knapsack problems (Q2288864): Difference between revisions

@@ Property / DOI @@
-.1007/s10479-018-3111-9
@@ Property / DOI: 10.1007/s10479-018-3111-9 / rank @@
-Normal rank
@@ Property / cites work @@
+New results on quantifier elimination over real closed fields and applications to constraint databases
+Normal rank
@@ Property / cites work @@
+The nonlinear knapsack problem - algorithms and applications
+Normal rank
@@ Property / cites work @@
+Approximate algorithms for some generalized knapsack problems
+Normal rank
@@ Property / cites work @@
+Q3988807
@@ Property / cites work: Q3988807 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4286721
@@ Property / cites work: Q4286721 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4821303
@@ Property / cites work: Q4821303 / rank @@
+Normal rank
@@ Property / cites work @@
+Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications
+Normal rank
@@ Property / cites work @@
+The symmetric quadratic knapsack problem: approximation and scheduling applications
+Normal rank
@@ Property / cites work @@
+Complex-demand scheduling problem with application in smart grid
+Normal rank
@@ Property / cites work @@
+Q4943600
@@ Property / cites work: Q4943600 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the Quadratic Knapsack Problem on Special Graph Classes
+Normal rank
@@ Property / cites work @@
+On the Computational Complexity of Approximating Solutions for Real Algebraic Formulae
+Normal rank
@@ Property / cites work @@
+Q3818127
@@ Property / cites work: Q3818127 / rank @@
+Normal rank
@@ Property / cites work @@
+The quadratic 0-1 knapsack problem with series-parallel support
+Normal rank
@@ Property / cites work @@
+When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
+Normal rank
@@ Property / Wikidata QID @@
+Q128812425
@@ Property / Wikidata QID: Q128812425 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S10479-018-3111-9
@@ Property / DOI: 10.1007/S10479-018-3111-9 / rank @@
+Normal rank