An extended formulation approach to the edge-weighted maximal clique problem (Q1278438): Difference between revisions

@@ Property / cites work @@
+The perfectly matchable subgraph polytope of a bipartite graph
+Normal rank
@@ Property / cites work @@
+Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean Functions
+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 @@
+Facets for the cut cone. I
@@ Property / cites work: Facets for the cut cone. I / rank @@
+Normal rank
@@ Property / cites work @@
+Facets for the cut cone. II: Clique-web inequalities
+Normal rank
@@ Property / cites work @@
+A cutting-plane approach to the edge-weighted maximal clique problem
+Normal rank
@@ Property / cites work @@
+Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
+Normal rank
@@ Property / cites work @@
+Weighted <i>k</i>‐cardinality trees: Complexity and polyhedral structure
+Normal rank
@@ Property / cites work @@
+Min-cut clustering
@@ Property / cites work: Min-cut clustering / rank @@
+Normal rank
@@ Property / cites work @@
+Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
+Normal rank
@@ Property / cites work @@
+The Boolean quadratic polytope: Some characteristics, facets and relatives
+Normal rank
@@ Property / cites work @@
+Heuristic and Special Case Algorithms for Dispersion Problems
+Normal rank
@@ Property / cites work @@
+Heuristically determining cliques of given cardinality and with minimal cost within weighted complete graphs
+Normal rank