Active Set Methods with Reoptimization for Convex Quadratic Integer Programming (Q3195322): Difference between revisions

@@ Property / cites work @@
+SCIP: solving constraint integer programs
@@ Property / cites work: SCIP: solving constraint integer programs / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithmic framework for convex mixed integer nonlinear programs
+Normal rank
@@ Property / cites work @@
+An effective branch-and-bound algorithm for convex quadratic integer programming
+Normal rank
@@ Property / cites work @@
+Optimization Methods in Finance
@@ Property / cites work: Optimization Methods in Finance / rank @@
+Normal rank
@@ Property / cites work @@
+Numerical Experience with Lower Bounds for MIQP Branch-And-Bound
+Normal rank
@@ Property / cites work @@
+A numerically stable dual method for solving strictly convex quadratic programs
+Normal rank
@@ Property / cites work @@
+An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming
+Normal rank
@@ Property / cites work @@
+The polynomial solvability of convex quadratic programming
+Normal rank
@@ Property / cites work @@
+An Infeasible Active Set Method for Quadratic Problems with Simple Bounds
+Normal rank
@@ Property / cites work @@
+An Algorithm for Convex Quadratic Programming That Requires <i>O</i>(<i>n</i><sup>3.5</sup><i>L</i>) Arithmetic Operations
+Normal rank
@@ Property / cites work @@
+Q5491447
@@ Property / cites work: Q5491447 / rank @@
+Normal rank
@@ Property / cites work @@
+Models and methods of solution of quadratic integer programming problems
+Normal rank