New facets and a branch-and-cut algorithm for the weighted clique problem. (Q1420411): Difference between revisions

@@ Property / cites work @@
+A cutting-plane approach to the edge-weighted maximal clique problem
+Normal rank
@@ Property / cites work @@
+A cutting plane algorithm for a clustering problem
+Normal rank
@@ Property / cites work @@
+A Lagrangian relaxation approach to the edge-weighted clique problem
+Normal rank
@@ Property / cites work @@
+Min-cut clustering
@@ Property / cites work: Min-cut clustering / rank @@
+Normal rank
@@ Property / cites work @@
+The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
+Normal rank
@@ Property / cites work @@
+Cardinality constrained Boolean quadratic polytope
+Normal rank
@@ Property / cites work @@
+The Boolean quadratic polytope: Some characteristics, facets and relatives
+Normal rank
@@ Property / cites work @@
+An extended formulation approach to the edge-weighted maximal clique problem
+Normal rank
@@ Property / cites work @@
+A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope
+Normal rank
@@ Property / cites work @@
+Heuristically determining cliques of given cardinality and with minimal cost within weighted complete graphs
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0377-2217(02)00852-4
+Normal rank
@@ Property / OpenAlex ID @@
+W2044024461
@@ Property / OpenAlex ID: W2044024461 / rank @@
+Normal rank