Skip to content

A C implementation of the Jonker-Volgenant algorithm to solve the minimum (or maximum) assignment problem in a bipartite graph

License

Notifications You must be signed in to change notification settings

fypc/Jonker-Volgenant

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

28 Commits
 
 
 
 
 
 
 
 

Repository files navigation

C implementation of the Jonker-Volgenant algorithm

Assignment problem in a bipartite graph

A C implementation of the Jonker-Volgenant algorithm to solve the minimum (or maximum) assignment problem in a bipartite graph. The function assign2DC can perform cost maximization or minimization with cost matrices having positive and/or negative elements whereas the function assign2DCBasic assumes that all elements of C are positive and that only minimization is performed.

January 2018 David F. Crouse, Naval Research Laboratory, Washington D.C. (UNCLASSIFIED) DISTRIBUTION STATEMENT A. Approved for public release.

About

A C implementation of the Jonker-Volgenant algorithm to solve the minimum (or maximum) assignment problem in a bipartite graph

Resources

License

Stars

Watchers

Forks

Packages

No packages published