A new variable reduction technique for convex integer quadratic programs (Q2472944): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.apm.2006.11.011
+Normal rank
@@ Property / OpenAlex ID @@
+W2068464776
@@ Property / OpenAlex ID: W2068464776 / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic programming algorithms for the optimal cutting of equal rectangles
+Normal rank
@@ Property / cites work @@
+Aggregate line capacity design for PWB assembly systems
+Normal rank
@@ Property / cites work @@
+An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
+Normal rank
@@ Property / cites work @@
+Exact Solution of the Quadratic Knapsack Problem
@@ Property / cites work: Exact Solution of the Quadratic Knapsack Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4821303
@@ Property / cites work: Q4821303 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3882189
@@ Property / cites work: Q3882189 / rank @@
+Normal rank
@@ Property / cites work @@
+Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions
+Normal rank
@@ Property / cites work @@
+Bimatrix Equilibrium Points and Mathematical Programming
+Normal rank
@@ Property / cites work @@
+Randomly Generated Test Problems for Positive Definite Quadratic Programming
+Normal rank
@@ Property / cites work @@
+Extensions and Applications of the Householder Algorithm for Solving Linear Least Squares Problems
+Normal rank
@@ Property / cites work @@
+An approximate dynamic programming approach to convex quadratic knapsack problems
+Normal rank