The operations on matrix for assignment problem
文献类型:会议论文
作者 | Yang LY(杨丽英)![]() ![]() |
出版日期 | 2008 |
会议名称 | Conference on Advances in Applied Mathematics, Systems, Communications and Computers |
会议日期 | June 1-3, 2008 |
会议地点 | Marathon Beach, GREECE |
关键词 | assignment problem method of exhaustion mixed-integer linear programming (MILP) relaxed linear programming (RLP) operations on matrix |
页码 | 151-163 |
中文摘要 | 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. |
收录类别 | CPCI(ISTP) |
产权排序 | 1 |
会议主办者 | Hellen Amer Univ q, Hellen Amer Union, N Atlant Univ Union |
会议录 | ADVANCES IN APPLIED MATHEMATICS, SYSTEMS, COMMUNICATIONS AND COMPUTERS
![]() |
会议录出版者 | WORLD SCIENTIFIC AND ENGINEERING ACAD AND SOC |
会议录出版地 | ATHENS |
语种 | 英语 |
ISBN号 | 978-960-6766-69-5 |
WOS记录号 | WOS:000257984000024 |
源URL | [http://ir.sia.cn/handle/173321/8911] ![]() |
专题 | 沈阳自动化研究所_机器人学研究室 |
推荐引用方式 GB/T 7714 | Yang LY,Nie MH,Wu ZW,et al. The operations on matrix for assignment problem[C]. 见:Conference on Advances in Applied Mathematics, Systems, Communications and Computers. Marathon Beach, GREECE. June 1-3, 2008. |
入库方式: OAI收割
来源:沈阳自动化研究所
浏览0
下载0
收藏0
其他版本
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。