Generalized Assignment Problem Solver
This code aims to implement an efficient solver for the generalized assignment problem.
The generalized assignment problem is described quite well on Wikipedia.
This code actually allows for further generalization, multiple agents to perform a single task (regulated by a task budget).
The implementation is a simple depth-first search algorithm. Therefore, it does not work well for very large problems.
The depth-first search expands most promising nodes first. True maximum assignment is guaranteed when algorithm is allowed to complete. Otherwise, the assignment printed last may be used as a best guess.
Solving your assignment problem is easy. Just specify your assignment problem (refer to main.rs for an example), then run it. An example problem specification is given, to make clear what syntax is expected.