Cycle-based facets of chromatic scheduling polytopes (Q1013295): Difference between revisions

@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / 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 @@
+Chromatic scheduling and frequency assignment
@@ Property / cites work: Chromatic scheduling and frequency assignment / rank @@
+Normal rank
@@ Property / cites work @@
+Consecutive colorings of graphs
@@ Property / cites work: Consecutive colorings of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Facets of the linear ordering polytope
@@ Property / cites work: Facets of the linear ordering polytope / rank @@
+Normal rank
@@ Property / cites work @@
+Geometric algorithms and combinatorial optimization
+Normal rank
@@ Property / cites work @@
+A characterization of the minimum cycle mean in a digraph
+Normal rank
@@ Property / cites work @@
+Parametric shortest path algorithms with an application to cyclic staffing
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Theory and algorithms
@@ Property / cites work: Combinatorial optimization. Theory and algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Chromatic scheduling polytopes coming from the bandwidth allocation problem in point-to-multipoint radio access systems
+Normal rank
@@ Property / cites work @@
+On the combinatorial structure of chromatic scheduling polytopes
+Normal rank
@@ Property / cites work @@
+Facet-inducing inequalities for chromatic scheduling polytopes based on covering cliques
+Normal rank