Institutional Repository
| A Low Complexity Interior-Point Algorithm for Linear Programming | |
| Michael J. Todd | |
| 1992 | |
| Source | SIAM J. Optim
 |
| Volume | 2Issue:2Pages:198-209 |
| Indexed Type | 其他 |
| Cooperation Status | 其它 |
| Keyword | Linear Programming Interior-point Methods |
| Language | 中文 |
| Content Type | 期刊论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/1254 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | Michael J. Todd. A Low Complexity Interior-Point Algorithm for Linear Programming[J]. SIAM J. Optim,1992,2(2):198-209. |
| APA | Michael J. Todd.(1992).A Low Complexity Interior-Point Algorithm for Linear Programming.SIAM J. Optim,2(2),198-209. |
| MLA | Michael J. Todd."A Low Complexity Interior-Point Algorithm for Linear Programming".SIAM J. Optim 2.2(1992):198-209. |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| BJ01107363.pdf（1911KB） | 开放获取 | License | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment