A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem (Q408371): Difference between revisions

@@ Property / cites work @@
+Q3619068
@@ Property / cites work: Q3619068 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4472434
@@ Property / cites work: Q4472434 / rank @@
+Normal rank
@@ Property / cites work @@
+Models and solution techniques for frequency assignment problems
+Normal rank
@@ Property / cites work @@
+Q4737533
@@ Property / cites work: Q4737533 / rank @@
+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 cutting plane algorithm for graph coloring
@@ Property / cites work: A cutting plane algorithm for graph coloring / 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 Column Generation Approach for Graph Coloring
@@ Property / cites work: A Column Generation Approach for Graph Coloring / rank @@
+Normal rank
@@ Property / cites work @@
+A column generation and branch-and-cut algorithm for the channel assignment problem
+Normal rank
@@ Property / cites work @@
+Erratum to ``Comparison of column generation models for channel assignment in cellular networks''
+Normal rank
@@ Property / cites work @@
+The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
+Normal rank