This notebook shows how a list of users with a list of constraints for Bed and Breakfast places (BNBs) can be paired with a list of BNBs that satisfy the constraints by performing a matrix multiplication to get the satisfaction matrix and then perform the Classical Assignment Problem algorithm on that matrix to get the pairings of users with BNBs where the user's constraints are satisfied as much as possible
HeinrichWizardKreuser/pandas-matrix-multilication
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
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published