全部版块 我的主页
论坛 提问 悬赏 求职 新闻 读书 功能一区 悬赏大厅 文献求助专区
1607 2
2011-07-11
【题名】:Computational experience with a dual affine variant of Karmarkar's method for linear programming
【作者】:Clyde L. Monma and Andrew J. Morton
【杂志名全称】:Operations Research Letters
【年, 卷(期), 起止页码】:Volume 6, Issue 6, December 1987, Pages 261-267
【DOI】:doi:10.1016/0167-6377(87)90040-X
【全文链接】:http://www.sciencedirect.com/science/article/pii/016763778790040X
【摘要信息】:The purpose of this paper is to describe computational experience with a dual affine variant of Karmarkar's method for solving linear programming problems. This approach was implemented by the authors over a twelve week period during the summer of 1986. Computational tests were made comparing this implementation with MINOS 5.0, a state-of-the-art implementation of the simplex method.
【求助者email】:sdfuture2003@eyou.com
谢谢
二维码

扫码加我 拉你入群

请注明:姓名-公司-职位

以便审核进群资格,未注明则拒绝

全部回复
2011-7-11 20:46:14
Computational experience with a dual affine variant of Karmarkar's method for linear programming
附件列表
二维码

扫码加我 拉你入群

请注明:姓名-公司-职位

以便审核进群资格,未注明则拒绝

2011-7-12 08:57:35
十分感谢!
二维码

扫码加我 拉你入群

请注明:姓名-公司-职位

以便审核进群资格,未注明则拒绝

相关推荐
栏目导航
热门文章
推荐文章

说点什么

分享

扫码加好友,拉您进群
各岗位、行业、专业交流群