NuGet Gallery Feed for LinearAssignmentC#-only solver for the rectangular linear assignment problem, also known as the minimum weight full matching problem for bipartite graphs. The algorithm is based on shortest augmenting path search.https://www.nuget.org/packages/LinearAssignment/2019-07-14T20:15:59Zhttps://www.nuget.org/packages/LinearAssignment/1.1.0LinearAssignment 1.1.02019-07-14T20:11:24Z2019-07-14T20:15:59Zfugledehttps://www.nuget.org/profiles/fugledeC#-only solver for the rectangular linear assignment problem, also known as the minimum weight full matching problem for bipartite graphs. The algorithm is based on shortest augmenting path search.https://www.nuget.org/packages/LinearAssignment/1.0.5LinearAssignment 1.0.52019-07-13T12:01:14Z2019-07-13T12:05:24Zfugledehttps://www.nuget.org/profiles/fugledeC#-only solver for the rectangular linear assignment problem, also known as the minimum weight full matching problem for bipartite graphs. The algorithm is based on shortest augmenting path search.https://www.nuget.org/packages/LinearAssignment/1.0.4LinearAssignment 1.0.42019-07-05T10:16:18Z2019-07-05T10:20:29Zfugledehttps://www.nuget.org/profiles/fugledeC#-only solver for the rectangular linear assignment problem, also known as the minimum weight full matching problem for bipartite graphs. The algorithm is based on shortest augmenting path search.https://www.nuget.org/packages/LinearAssignment/1.0.3LinearAssignment 1.0.32019-06-30T20:10:09Z2019-06-30T20:17:19Zfugledehttps://www.nuget.org/profiles/fugledeC#-only solver for the rectangular linear assignment problem, also known as the minimum weight full matching problem for bipartite graphs. The algorithm is based on shortest augmenting path search.