Skip to content

njung1292/assignmentSolver

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

51 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

assignmentSolver

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.

About

Solves the assignment problem using the Hungarian algorithm.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages