首页 | 本学科首页   官方微博 | 高级检索  
     


Progress in the dual simplex algorithm for solving large scale LP problems: techniques for a fast and stable implementation
Authors:Achim Koberstein
Affiliation:(1) Decision Support & Operations Research Lab, University of Paderborn, Warburger Str. 100, 33100 Paderborn, Germany
Abstract:
Keywords:Linear programming  Dual simplex algorithm  MIP-solver MOPS
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号