Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem (Q1762145): Difference between revisions

@@ Property / cites work @@
+Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
+Normal rank
@@ Property / cites work @@
+Computational aspects of a branch and bound algorithm for quadratic zero- one programming
+Normal rank
@@ Property / cites work @@
+Minimization of a quadratic pseudo-Boolean function
+Normal rank
@@ Property / cites work @@
+Lower bound improvement and forcing rule for quadratic binary programming
+Normal rank
@@ Property / cites work @@
+Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
+Normal rank
@@ Property / cites work @@
+One-pass heuristics for large-scale unconstrained binary quadratic problems
+Normal rank
@@ Property / cites work @@
+Multistart tabu search strategies for the unconstrained binary quadratic optimization problem
+Normal rank
@@ Property / cites work @@
+Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem
+Normal rank
@@ Property / cites work @@
+On the equivalence between roof duality and Lagrangian duality for unconstrained \(0\)-\(1\) quadratic programming problems
+Normal rank
@@ Property / cites work @@
+Linear forms of nonlinear expressions: new insights on old ideas
+Normal rank
@@ Property / cites work @@
+A Decomposition Method for Quadratic Zero-One Programming
+Normal rank
@@ Property / cites work @@
+Lagrangean decompositions for the unconstrained binary quadratic programming problem
+Normal rank
@@ Property / cites work @@
+Adaptive Memory Tabu Search for Binary Quadratic Programs
+Normal rank