中文说明：应用背景该算法是利用分配问题。该算法找到一个最佳匹配之间的任务和氮代理。关键技术该算法找到一个最佳匹配之间的任务和氮代理。该算法是快速的（（3））。它recibes矩阵的n×n，表示 ；实用 ；分配任务J剂即 ；该算法是求解指派问题的工具。 ；
English Description：
Application backgroundThis algorithm is util for assignment problem. The algorithm find an optimum matching between a set the n task and n agents.Key TechnologyThe algorithm find an optimum matching between a set the n task and n agents. This algorithm is fast (O(n^3)). It recibes a matrix nxn, it indicates the utility of assigned task j to agent i. This algorithm is util for assignment problem.