A branch-and-price approach for the partition coloring problem (Q2275580): Difference between revisions

@@ Property / cites work @@
+Finding a Maximum Clique in an Arbitrary Graph
@@ Property / cites work: Finding a Maximum Clique in an Arbitrary Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q3439702
@@ Property / cites work: Q3439702 / rank @@
+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 branch-and-cut algorithm for partition coloring
@@ Property / cites work: A branch-and-cut algorithm for partition coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Q5630824
@@ Property / cites work: Q5630824 / 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 @@
+A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
+Normal rank
@@ Property / cites work @@
+Vertex packings: Structural properties and algorithms
+Normal rank
@@ Property / cites work @@
+Routing and wavelength assignment by partition colouring
+Normal rank