The Kuhn-Munkres Algorithm, Often The Hungarian Method is a Combinatorial Optimisation Algorithm Used to Solve the Optimisation Problem. It Finds the Optimal Assignment in a Weighted Bipartite Graph
-
Updated
Dec 2, 2025 - Rust
#
combinatorial-optimisation
Here are 4 public repositories matching this topic...
🚂 Microscopic Railway Scheduling: Combining MIP and SMT through Clustering and Hypergraph Duality (Master's Thesis)
master-thesis gurobi eth smt mip scheduling-algorithms railways benders-decomposition combinatorial-optimisation
-
Updated
Mar 22, 2026
The AMPL solver for Knapsack Problem
ampl linear-programming operations-research knapsack-problem operational-research integer-programming combinatorial-optimization mathematical-programming combinatorial-optimisation
-
Updated
Feb 12, 2026 - AMPL
AMPL models for solving the N-Queens problem
ampl operations-research operational-research integer-programming combinatorial-optimization n-queens-problem milp-model combinatorial-optimisation
-
Updated
Jan 29, 2026 - AMPL
Improve this page
Add a description, image, and links to the combinatorial-optimisation topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the combinatorial-optimisation topic, visit your repo's landing page and select "manage topics."