The Kidney Matching problem aims to find a maximum packing of cycles of bounded length and (optionally) chains in a directed graph. This is an implementation using the Mixed Integer Programming formulation introduced here
mburq/KidneyMatching
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|