Modeling and Solution for Assignment Problem
文献类型:期刊论文
| 作者 | Yang LY(杨丽英) ; Nie MH(聂明泓); Wu ZW(吴镇炜) ; Nie YY(聂义勇)
|
| 刊名 | International Journal of Mathematical Models and Methodes in Applied Sciences
![]() |
| 出版日期 | 2008 |
| 卷号 | 2期号:2页码:205-212 |
| 关键词 | Assignment problem method of exhaustion mixed-integer linear programming (MILP) operations on matrix |
| ISSN号 | 1998-0140 |
| 产权排序 | 1 |
| 中文摘要 | 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. |
| 语种 | 英语 |
| 公开日期 | 2012-05-29 |
| 源URL | [http://ir.sia.cn/handle/173321/7377] ![]() |
| 专题 | 沈阳自动化研究所_机器人学研究室 |
| 推荐引用方式 GB/T 7714 | Yang LY,Nie MH,Wu ZW,et al. Modeling and Solution for Assignment Problem[J]. International Journal of Mathematical Models and Methodes in Applied Sciences,2008,2(2):205-212. |
| APA | Yang LY,Nie MH,Wu ZW,&Nie YY.(2008).Modeling and Solution for Assignment Problem.International Journal of Mathematical Models and Methodes in Applied Sciences,2(2),205-212. |
| MLA | Yang LY,et al."Modeling and Solution for Assignment Problem".International Journal of Mathematical Models and Methodes in Applied Sciences 2.2(2008):205-212. |
入库方式: OAI收割
来源:沈阳自动化研究所
浏览0
下载0
收藏0
其他版本
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。


