License class design: Complexity and algorithms (Q1207538): Difference between revisions

@@ Property / cites work @@
+Scheduling jobs with fixed start and end times
@@ Property / cites work: Scheduling jobs with fixed start and end times / rank @@
+Normal rank
@@ Property / cites work @@
+When Is the Classroom Assignment Problem Hard?
@@ Property / cites work: When Is the Classroom Assignment Problem Hard? / rank @@
+Normal rank
@@ Property / cites work @@
+A decomposition theorem for partially ordered sets
+Normal rank
@@ Property / cites work @@
+Max-min matching problems with multiple assignments
+Normal rank
@@ Property / cites work @@
+On the complexity of computing the measure of ∪[a             <sub>i</sub>             ,b             <sub>i</sub>             ]
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimal Resources for Fixed and Variable Job Schedules
+Normal rank
@@ Property / cites work @@
+An Optimal Solution for the Channel-Assignment Problem
+Normal rank
@@ Property / cites work @@
+On the computational complexity of (maximum) class scheduling
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0377-2217(92)90160-b
+Normal rank
@@ Property / OpenAlex ID @@
+W2125434722
@@ Property / OpenAlex ID: W2125434722 / rank @@
+Normal rank