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.
Constraint-based emergency ambulance allocation system in Java. Assigns ambulances to calls by priority, distance, equipment and hospital capacity, and re-allocates automatically.
Java implementations and experiments comparing traditional and divide-and-conquer Hungarian search for minimum-cost bipartite matching and optimal transport.
Step-by-step Hungarian Method and Travelling Salesman Problem (TSP) tutorial with theory, worked examples, and Java implementation.
To associate your repository with the hungarian-algorithm topic, visit your repo's landing page and select "manage topics."