Quadratic knapsack relaxations using cutting planes and semidefinite programming (Q4645922): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/3-540-61310-2_14
+Normal rank
@@ Property / OpenAlex ID @@
+W1509288136
@@ Property / OpenAlex ID: W1509288136 / rank @@
+Normal rank
@@ Property / cites work @@
+A lift-and-project cutting plane algorithm for mixed 0-1 programs
+Normal rank
@@ Property / cites work @@
+The cut polytope and the Boolean quadric polytope
@@ Property / cites work: The cut polytope and the Boolean quadric polytope / rank @@
+Normal rank
@@ Property / cites work @@
+Formulations and valid inequalities of the node capacitated graph partitioning problem
+Normal rank
@@ Property / cites work @@
+Combining semidefinite and polyhedral relaxations for integer programs
+Normal rank
@@ Property / cites work @@
+An Interior-Point Method for Semidefinite Programming
+Normal rank
@@ Property / cites work @@
+Min-cut clustering
@@ Property / cites work: Min-cut clustering / rank @@
+Normal rank
@@ Property / cites work @@
+Cones of Matrices and Set-Functions and 0–1 Optimization
+Normal rank
@@ Property / cites work @@
+The Boolean quadratic polytope: Some characteristics, facets and relatives
+Normal rank
@@ Property / cites work @@
+On the \(0/1\) knapsack polytope
@@ Property / cites work: On the \(0/1\) knapsack polytope / rank @@
+Normal rank
@@ Property / DBLP publication ID @@
+conf/ipco/HelmbergRW96
@@ Property / DBLP publication ID: conf/ipco/HelmbergRW96 / rank @@
+Normal rank