Pages that link to "Item:Q1359459"
From MaRDI portal
The following pages link to Max-min matching problems with multiple assignments (Q1359459):
Displaying 6 items.
- On the computational complexity of (maximum) shift class scheduling (Q684343) (← links)
- On the computational complexity of (maximum) class scheduling (Q1179005) (← links)
- License class design: Complexity and algorithms (Q1207538) (← links)
- Algorithms for preemptive scheduling of different classes of processors to do jobs with fixed times (Q1310017) (← links)
- On the Problem of Multiple Matching (Q5841844) (← links)
- (Q5875458) (← links)