Open questions in complexity theory for numerical optimization (Q687097): Difference between revisions

@@ Property / cites work @@
+Linear Time Algorithms for Two- and Three-Variable Linear Programs
+Normal rank
@@ Property / cites work @@
+Minimum concave-cost network flow problems: Applications, complexity, and algorithms
+Normal rank
@@ Property / cites work @@
+A polynomial time solvable concave network flow problem
+Normal rank
@@ Property / cites work @@
+How easy is local search?
@@ Property / cites work: How easy is local search? / rank @@
+Normal rank
@@ Property / cites work @@
+Bimatrix Equilibrium Points and Mathematical Programming
+Normal rank
@@ Property / cites work @@
+Linear Programming in Linear Time When the Dimension Is Fixed
+Normal rank
@@ Property / cites work @@
+On the solution of concave knapsack problems
@@ Property / cites work: On the solution of concave knapsack problems / rank @@
+Normal rank
@@ Property / cites work @@
+Computational complexity of complementary pivot methods
+Normal rank
@@ Property / cites work @@
+Some NP-complete problems in quadratic and nonlinear programming
+Normal rank
@@ Property / cites work @@
+Checking local optimality in constrained quadratic programming is NP- hard
+Normal rank
@@ Property / cites work @@
+Quadratic programming with one negative eigenvalue is NP-hard
+Normal rank
@@ Property / cites work @@
+A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
+Normal rank
@@ Property / cites work @@
+Complexity of linear programming
@@ Property / cites work: Complexity of linear programming / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for indefinite quadratic programming
+Normal rank