A polyhedral study of the maximum stable set problem with weights on vertex-subsets (Q299097): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2015.05.032
+Normal rank
@@ Property / OpenAlex ID @@
+W626430230
@@ Property / OpenAlex ID: W626430230 / rank @@
+Normal rank
@@ Property / cites work @@
+On the asymmetric representatives formulation for the vertex coloring problem
+Normal rank
@@ Property / cites work @@
+Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results
+Normal rank
@@ Property / cites work @@
+Maximum-weight stable sets and safe lower bounds for graph coloring
+Normal rank
@@ Property / cites work @@
+An exact approach for the vertex coloring problem
@@ Property / cites work: An exact approach for the vertex coloring problem / rank @@
+Normal rank
@@ Property / cites work @@
+A Column Generation Approach for Graph Coloring
@@ Property / cites work: A Column Generation Approach for Graph Coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Q4547547
@@ Property / cites work: Q4547547 / rank @@
+Normal rank
@@ Property / cites work @@
+A fast algorithm for the maximum clique problem
@@ Property / cites work: A fast algorithm for the maximum clique problem / rank @@
+Normal rank
@@ Property / cites work @@
+A branch-and-cut algorithm for the maximum cardinality stable set problem
+Normal rank