Skip to content

Two different solutions for the assignment problem using the GLPK solver and the greedy algorithm.

Notifications You must be signed in to change notification settings

castroisabel/assignment-problem

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

17 Commits
 
 
 
 
 
 
 
 

Repository files navigation

assignment-problem

Given a set of resources and a set of tasks to be performed, the assignment problem consists of deciding which resources will be allocated to which tasks at the lowest possible cost.

For this problem we use two methods:

  1. The simplex method is an algorithm that uses linear algebra-based tooling to interactively determine an optimal solution to a linear programming problem (PPL).

  2. The greedy algorithm is a simple, intuitive algorithm that is used in optimization problems. The algorithm makes the optimal choice at each step as it attempts to find the overall optimal way to solve the entire problem.

Releases

No releases published

Packages

No packages published

Languages