A Combined Parallel Lagrangian Decomposition and Cutting-Plane Generation for Maximum Stable Set Problems (Q2883604): Difference between revisions

@@ Property / cites work @@
+Q4230321
@@ Property / cites work: Q4230321 / rank @@
+Normal rank
@@ Property / cites work @@
+Conflict graphs in solving integer programming problems
+Normal rank
@@ Property / cites work @@
+A Branch-and-Cut Algorithm for Equitable Coloring based on a Formulation by Representatives
+Normal rank
@@ Property / cites work @@
+On the asymmetric representatives formulation for the vertex coloring problem
+Normal rank
@@ Property / cites work @@
+Cliques, holes and the vertex coloring polytope
@@ Property / cites work: Cliques, holes and the vertex coloring polytope / rank @@
+Normal rank
@@ Property / cites work @@
+A Class Representative Model for Pure Parsimony Haplotyping
+Normal rank
@@ Property / cites work @@
+Polyhedral results for the bipartite induced subgraph problem
+Normal rank
@@ Property / cites work @@
+A branch-and-cut algorithm for graph coloring
@@ Property / cites work: A branch-and-cut algorithm for graph coloring / rank @@
+Normal rank
@@ Property / cites work @@
+A branch-and-cut algorithm for the maximum cardinality stable set problem
+Normal rank
@@ Property / cites work @@
+Q5687277
@@ Property / cites work: Q5687277 / rank @@
+Normal rank