Combining QCR and CHR for convex quadratic pure 0--1 programming problems with linear constraints (Q1761747): 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/s10479-011-0969-1
+Normal rank
@@ Property / OpenAlex ID @@
+W1977277162
@@ Property / OpenAlex ID: W1977277162 / rank @@
+Normal rank
@@ Property / cites work @@
+Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
+Normal rank
@@ Property / cites work @@
+Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations
+Normal rank
@@ Property / cites work @@
+Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
+Normal rank
@@ Property / cites work @@
+Q4178782
@@ Property / cites work: Q4178782 / rank @@
+Normal rank
@@ Property / cites work @@
+Lagrangean relaxation. (With comments and rejoinder).
+Normal rank
@@ Property / cites work @@
+Q5613011
@@ Property / cites work: Q5613011 / rank @@
+Normal rank
@@ Property / cites work @@
+Restricted simplicial decomposition: Computation and extensions
+Normal rank
@@ Property / cites work @@
+Lagrangean decomposition for integer nonlinear programming with linear constraints
+Normal rank
@@ Property / cites work @@
+Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique
+Normal rank
@@ Property / cites work @@
+Simplicial decomposition in nonlinear programming algorithms
+Normal rank