A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Pareto optimal matchings of students to courses in the presence of prerequisites
2018
Discrete Optimization
time for lexicographic preferences. In the latter case, the problem of finding a maximum cardinality POM is NP-hard and very difficult to approximate.
doi:10.1016/j.disopt.2018.04.004
fatcat:g7lwc6n37ve2zaesbqtz2owjyy