A Java implementation of the Kuhn–Munkres assignment algorithm (Hungarian Algorithm)
-
Updated
Aug 10, 2019 - Java
A Java implementation of the Kuhn–Munkres assignment algorithm (Hungarian Algorithm)
Integrated front-end and back-end system for vehicle dispatch, routing, pickup and delivery planning, and control simulation.
Matches JSON-keys and values best effort using translations, synonyms and Levenshtein distance. Also provides value and unit conversion of the associated JSON-values. Part of a Seminar Thesis at the Institute of Enterprise Systems at the University of Mannheim.
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."