Restrictions and preassignments in preemptive open shop scheduling (Q1917354): Difference between revisions

@@ Property / cites work @@
+Q5615282
@@ Property / cites work: Q5615282 / rank @@
+Normal rank
@@ Property / cites work @@
+Balanced matrices
@@ Property / cites work: Balanced matrices / rank @@
+Normal rank
@@ Property / cites work @@
+Q3821925
@@ Property / cites work: Q3821925 / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-Chromatic Scheduling with Simultaneity Constraints
+Normal rank
@@ Property / cites work @@
+On the Complexity of Timetable and Multicommodity Flow Problems
+Normal rank
@@ Property / cites work @@
+Q4133404
@@ Property / cites work: Q4133404 / rank @@
+Normal rank
@@ Property / cites work @@
+Lattice Polyhedra II: Generalization, Constructions and Examples
+Normal rank
@@ Property / cites work @@
+The ellipsoid method and its consequences in combinatorial optimization
+Normal rank
@@ Property / cites work @@
+An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+Some results concerning the complexity of restricted colorings of graphs
+Normal rank
@@ Property / cites work @@
+Interval edge coloring of a graph with forbidden colors
+Normal rank