Complexity results for some global optimization problems (Q1024247): Difference between revisions

@@ 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.1007/s10957-008-9448-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2036807485
@@ Property / OpenAlex ID: W2036807485 / rank @@
+Normal rank
@@ Property / cites work @@
+Computational complexity of norm-maximization
@@ Property / cites work: Computational complexity of norm-maximization / rank @@
+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 @@
+The complexity of approximating a nonlinear program
+Normal rank
@@ Property / cites work @@
+Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
+Normal rank
@@ Property / cites work @@
+Geometric optimization problems likely not contained in \(\mathbb A\mathbb P\mathbb X\)
+Normal rank
@@ Property / cites work @@
+Q4527183
@@ Property / cites work: Q4527183 / rank @@
+Normal rank
@@ Property / cites work @@
+A PTAS for the minimization of polynomials of fixed degree over the simplex
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for indefinite quadratic programming
+Normal rank
@@ Property / cites work @@
+Approximating quadratic programming with bound and quadratic constraints
+Normal rank
@@ Property / cites work @@
+Maxima for Graphs and a New Proof of a Theorem of Turán
+Normal rank
@@ Property / cites work @@
+Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
+Normal rank
@@ Property / cites work @@
+Q4526964
@@ Property / cites work: Q4526964 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1024247