ILP models and column generation for the minimum sum coloring problem (Q1742227): Difference between revisions

@@ Property / cites work @@
+Tight bounds on the chromatic sum of a connected graph
+Normal rank
@@ Property / cites work @@
+Maximum-weight stable sets and safe lower bounds for graph coloring
+Normal rank
@@ Property / cites work @@
+A memetic algorithm for the minimum sum coloring problem
+Normal rank
@@ Property / cites work @@
+Hybrid evolutionary search for the minimum sum coloring problem of graphs
+Normal rank
@@ Property / cites work @@
+Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem
+Normal rank
@@ Property / cites work @@
+Lower Bounds for the Minimal Sum Coloring Problem
@@ Property / cites work: Lower Bounds for the Minimal Sum Coloring Problem / rank @@
+Normal rank
@@ Property / cites work @@
+A survey on vertex coloring problems
@@ Property / cites work: A survey on vertex coloring problems / 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 @@
+On the cost-chromatic number of graphs
@@ Property / cites work: On the cost-chromatic number of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On sum coloring of graphs
@@ Property / cites work: On sum coloring of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On a graph partition problem with application to VLSI layout
+Normal rank
@@ Property / cites work @@
+A new \textsf{DSATUR}-based algorithm for exact vertex coloring
+Normal rank
@@ Property / cites work @@
+An effective heuristic algorithm for sum coloring of graphs
+Normal rank