Numerical Study of Semidefinite Bounds for the k-cluster Problem (Q2883586): 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.1016/j.endm.2010.05.051
+Normal rank
@@ Property / OpenAlex ID @@
+W1969992797
@@ Property / OpenAlex ID: W1969992797 / rank @@
+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 @@
+CSDP, A C library for semidefinite programming
@@ Property / cites work: CSDP, A C library for semidefinite programming / rank @@
+Normal rank
@@ Property / cites work @@
+Partial Lagrangian relaxation for general quadratic programming
+Normal rank
@@ Property / cites work @@
+A Spectral Bundle Method for Semidefinite Programming
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for maximum graph partitioning problems
+Normal rank
@@ Property / cites work @@
+A constant approximation algorithm for the densest \(k\)-subgraph problem on chordal graphs
+Normal rank
@@ Property / cites work @@
+A Dual Approach to Semidefinite Least-Squares Problems
+Normal rank
@@ Property / cites work @@
+Solving \(k\)-cluster problems to optimality with semidefinite programming
+Normal rank