中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
Calculation of penalties in algorithm of mixed integer programming solving with revised dual simplex method for bounded variables

文献类型:期刊论文

作者Wei, YM ; Hu, QH
刊名JOURNAL OF COMPUTATIONAL MATHEMATICS
出版日期1999
卷号17期号:5页码:8,545-552
关键词penalties stronger penalties the revised dual simplex method for bounded variables
ISSN号0254-9409
中文摘要The branch-and-bound method with the revised dual simplex for bounded variables is very effective in solving relatively large-size integer linear programming problems. This paper, based on the general forms of the penalties by Beale and Small and the stronger penalties by Tomlin, describes the modifications of these penalties used for the method of bounded variables. The same examples from Petersen are taken and the satisfactory results are shown in comparison with those obtained by Tomlin.
学科主题Mathematics, Applied; Mathematics
收录类别SCI
语种英语
WOS记录号WOS:000082771300009
公开日期2012-11-12
源URL[http://ir.casipm.ac.cn/handle/190111/5379]  
专题科技战略咨询研究院_中国科学院科技政策与管理科学研究所(1985年6月-2015年12月)
推荐引用方式
GB/T 7714
Wei, YM,Hu, QH. Calculation of penalties in algorithm of mixed integer programming solving with revised dual simplex method for bounded variables[J]. JOURNAL OF COMPUTATIONAL MATHEMATICS,1999,17(5):8,545-552.
APA Wei, YM,&Hu, QH.(1999).Calculation of penalties in algorithm of mixed integer programming solving with revised dual simplex method for bounded variables.JOURNAL OF COMPUTATIONAL MATHEMATICS,17(5),8,545-552.
MLA Wei, YM,et al."Calculation of penalties in algorithm of mixed integer programming solving with revised dual simplex method for bounded variables".JOURNAL OF COMPUTATIONAL MATHEMATICS 17.5(1999):8,545-552.

入库方式: OAI收割

来源:科技战略咨询研究院

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。