This is an algorithm with uses the branch and bound method to solve the assignment problem .
This is an algorithm for graph coloring ( http://en.wikipedia.org/wiki/Graph_coloring ) built on the JaCoP Constraint Programming Solver ( https://github.com/radsz/jacop
This is an implementation of the Branch and Bound algorithm, used to solve an assignment problem.
There is something wrong with this algo.
This algo is used to solve the Conference Scheduling Problem .