An FPTAS for minimizing the product of two non-negative linear cost functions (Q623370): Difference between revisions

@@ Property / DOI @@
-.1007/s10107-009-0287-4
@@ Property / DOI: 10.1007/s10107-009-0287-4 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10107-009-0287-4
+Normal rank
@@ Property / OpenAlex ID @@
+W2161103838
@@ Property / OpenAlex ID: W2161103838 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4821526
@@ Property / cites work: Q4821526 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4747150
@@ Property / cites work: Q4747150 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Schemes for the Restricted Shortest Path Problem
+Normal rank
@@ Property / cites work @@
+Quadratic programming and combinatorial minimum weight product problems
+Normal rank
@@ Property / cites work @@
+\(NP\)-hardness of linear multiplicative programming and related problems
+Normal rank
@@ Property / cites work @@
+Quadratic programming with one negative eigenvalue is NP-hard
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for indefinite quadratic programming
+Normal rank
@@ Property / DOI @@
+.1007/S10107-009-0287-4
@@ Property / DOI: 10.1007/S10107-009-0287-4 / rank @@
+Normal rank