A branch-and-cut algorithm for partition coloring (Q3057147): Difference between revisions

@@ Property / cites work @@
+Set Partitioning: A survey
@@ Property / cites work: Set Partitioning: A survey / rank @@
+Normal rank
@@ Property / cites work @@
+Chromatic Scheduling and the Chromatic Number 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 @@
+Separating lifted odd-hole inequalities to solve the index selection problem
+Normal rank
@@ Property / cites work @@
+A probabilistic heuristic for a computationally difficult set covering problem
+Normal rank
@@ Property / cites work @@
+A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
+Normal rank
@@ Property / cites work @@
+Acyclic Orientations with Path Constraints
@@ Property / cites work: Acyclic Orientations with Path Constraints / rank @@
+Normal rank
@@ Property / cites work @@
+Solving Airline Crew Scheduling Problems by Branch-and-Cut
+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 @@
+Routing and wavelength assignment by partition colouring
+Normal rank
@@ Property / cites work @@
+A GRASP with path-relinking for private virtual circuit routing
+Normal rank
@@ Property / cites work @@
+An upper bound for the chromatic number of a graph and its application to timetabling problems
+Normal rank