A polyhedral study of nonconvex quadratic programs with box constraints (Q1774169): Difference between revisions

@@ Property / cites work @@
+A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems
+Normal rank
@@ Property / cites work @@
+Solving Large-Scale Zero-One Linear Programming Problems
+Normal rank
@@ Property / cites work @@
+A barrier function method for the nonconvex quadratic programming problem with box constraints
+Normal rank
@@ Property / cites work @@
+Q4352739
@@ Property / cites work: Q4352739 / rank @@
+Normal rank
@@ Property / cites work @@
+Facets of the Complementarity Knapsack Polytope
@@ Property / cites work: Facets of the Complementarity Knapsack Polytope / rank @@
+Normal rank
@@ Property / cites work @@
+A polyhedral study of the cardinality constrained knapsack problem
+Normal rank
@@ Property / cites work @@
+A note on a quadratic formulation for linear complementarity problems
+Normal rank
@@ Property / cites work @@
+Q4697332
@@ Property / cites work: Q4697332 / rank @@
+Normal rank
@@ Property / cites work @@
+The Boolean quadratic polytope: Some characteristics, facets and relatives
+Normal rank
@@ Property / cites work @@
+Q5670441
@@ Property / cites work: Q5670441 / rank @@
+Normal rank
@@ Property / cites work @@
+A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
+Normal rank
@@ Property / cites work @@
+Q3137900
@@ Property / cites work: Q3137900 / rank @@
+Normal rank
@@ Property / cites work @@
+A polyhedral approach for nonconvex quadratic programming problems with box constraints
+Normal rank