This is the code for the Teaching Assistant allocation problem modelled as bipartite graph matching which is solved using markov chain monte carlo based method.
- CSV
- LinearAlgebra
- Statistics
- JLD
Note: The packaging of this code is currently underway for potentially expanding it for solving general allotment problems of this kind. For now, if you want to use the code with your dataset, please call the juliaAllotter.jl file in 'src' in julia REPL. This will generate the myfile.jld file in the results directory and the performance metrics can be visualized using the visual.ipynb file provided.