The knapsack problem is implemented in Julia using JuMP and is solved with GLPK.
-
Updated
Nov 7, 2021 - Julia
The knapsack problem is implemented in Julia using JuMP and is solved with GLPK.
Here I have implemented the Assigment Problem which is a well known optimization problem.
Resolving Binary modelisation of knapsack problem using two different methods bounding tehcniques
Linear assignment problem resolution using Hungarian algorithm and comparing it with GLPK 's solver result.
Add a description, image, and links to the glpk topic page so that developers can more easily learn about it.
To associate your repository with the glpk topic, visit your repo's landing page and select "manage topics."