The Dietrich College advisors at Carnegie Mellon University face the problem of registering roughly 350 freshmen into about 22 seminars each year. For years they have been balancing the registration results and resolving conflicts by hand. Our project team aims to apply operations research techniques to reach an optimal assignment solution in a programmatic way. Our program solves this assignment problem by applying the Hungarian algorithm.
-
Notifications
You must be signed in to change notification settings - Fork 0
njung1292/assignmentSolver
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
Solves the assignment problem using the Hungarian algorithm.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published