In this paper, we proposed a multi-objective MIP model for IT allocation, and a Hungarian Algorithm is introduced to solve the problem in a preferable period of time. Numerical experiment shows that, ...

This algorithm operates within a framework of discrete convex optimization and has been shown to run in polynomial time, further emphasizing the importance of polynomial time algorithms in solving ...