The operations on matrix for assignment problem

L. Y. Yang, M. H. Nie, Z. W. Wu,Y. Y. Nie

ADVANCES IN APPLIED MATHEMATICS, SYSTEMS, COMMUNICATIONS AND COMPUTERS（2008）

引用 0|浏览2

暂无评分

摘要

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 for both minimax and global-minimum assignment problems.

查看译文

关键词

assignment problem,method of exhaustion,mixed-integer linear programming (MILP),relaxed linear programming (RLP),operations on matrix

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要