Modeling and Solution for Assignment Problem

In this paper, the mixed-integer linear programming (MILP) of minimax assignment is formed, and a solution called Operations on Matrix is presented and compared with the solutions of exhaustion and MILP. Theoretical analyses and numerical tests show that the operations on matrix are efficient well-implied enumeration for both minimax and global-minimum assignment problems.