A Simple NPM package for solving Operations Research Problems
-
Updated
Jan 9, 2024 - JavaScript
A Simple NPM package for solving Operations Research Problems
The Hungarian algorithm solves the assignment problem in polynomial time. Also known as: Munkres algorithm.
Maximum and minimum cost assignments using the Hungarian/Munkres algorithm for n × m cost matrices
Add a description, image, and links to the hungarian-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the hungarian-algorithm topic, visit your repo's landing page and select "manage topics."