Branch and Bound Method for Assignment Problem

In this paper, we propose to solve assignment problem using branch and bound (BB) method. The assignment problem is first transformed to travelling salesman problem (TSP) problem and then solved as a routing problem. This BB method can solve both minimization and maximization assignment problems. Numerical illustrations are used to prove the efficiency and validity of the algorithm. BB algorithm is also compared with Hungarian method on some few small instances, and the proposed algorithm managed to compute near optimal and optimal solutions.