This demo will optimally pair together all entities in a list based on their "specs". For example, suppose you are a college with thousands of students who need paired together as roommates for the upcoming school year. Students could take a survey where they enter information about themselves like average wake and sleep times, cleanliness, and extroversion, and this pairing algorithm would optimally assign them!
Pairing problems like the Stable Roommates Problem have been solved for a few decades now, so this is nothing fancy or new. Rather than implement that old algorithm, I've formulated this problem as a generic Integer Program, so no preference / sorted ranking matrix is necessary, which is nice (leave that sort of thing up to the machine to make!).
Upload a .csv file containing the things you would like to pair. Note that if an uneven number of rows are provided, the last row will be dropped.
The name of the things should be in the first column, and the data about those things can be in any number of following columns.
Ain't got no data?
Module may take a few seconds to run - be patient please!