Author:
Deza Antoine,Terlaky Tamás,Zinchenko Yuriy
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference14 articles.
1. Dantzig, G.: Linear Programming and Extensions. Princeton University Press, Princeton (1963)
2. Dedieu, J.-P., Malajovich, G., Shub, M.: On the curvature of the central path of linear programming theory. Found. Comput. Math. 5, 145–171 (2005)
3. Deza, A., Terlaky, T., Zinchenko, Y.: Central path curvature and iteration-complexity for redundant Klee–Minty cubes. In: Gao D. and Sherali H. (eds.) Advances in Mechanics and Mathematics, vol. III, pp. 215–248 (2007)
4. Deza, A., Terlaky, T., Zinchenko, Y.: Polytopes and arrangements: diameter and curvature. Oper. Res. Lett. 36-2, 215–222 (2008)
5. Fritzsche, K., Holt, F.: More polytopes meeting the conjectured Hirsch bound. Discrete Math. 205, 77–84 (1999)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献