Graph-based Hungarian assignment algorithm
-
Updated
Jan 5, 2022 - C++
Graph-based Hungarian assignment algorithm
A simple Branch and Bound for the Traveling Tournament Problem with Minimum Assignment Problem using the Hungarian Method
Take the input data of the problemfrom a text file (your input will basically be a NxN square matrix of integers and asicallydetermine how much time and memory your programs spend during runtime, and print thisinformation to the output file.(xperiments by choosing the row/column numbers of yourinput matrix as 5, 10, 100, 1000, 10000, 100000, in …
Add a description, image, and links to the hungarian-assignment topic page so that developers can more easily learn about it.
To associate your repository with the hungarian-assignment topic, visit your repo's landing page and select "manage topics."