Beyond Hirsch Conjecture: Walks on Random Polytopes and Smoothed Complexity of the Simplex Method
暂无分享,去创建一个
[1] Michael J. Todd,et al. Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems , 1986, Math. Program..
[2] Daniel A. Spielman,et al. Improved smoothed analysis of the shadow vertex simplex method , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[3] S. Szarek. Spaces with large distance to l∞n and random matrices , 1990 .
[4] Nimrod Megiddo,et al. A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension , 1985, JACM.
[5] H. Raynaud. Sur L'enveloppe convexe des nuages de points aleatoires dans Rn . I , 1970 .
[6] Irene Hueter,et al. Limit theorems for the convex hull of random points in higher dimensions , 1999 .
[7] Richard M. Karp,et al. A simplex variant solving an m times d linear program in O(min(m2, d2) expected number of pivot steps , 1987, J. Complex..
[8] Arkadi Nemirovski,et al. On Polyhedral Approximations of the Second-Order Cone , 2001, Math. Oper. Res..
[9] M. Ledoux. The concentration of measure phenomenon , 2001 .
[10] L. Santaló. Integral geometry and geometric probability , 1976 .
[11] G. Kalai,et al. A quasi-polynomial bound for the diameter of graphs of polyhedra , 1992, math/9204233.
[12] T. L. Saaty,et al. The computational algorithm for the parametric objective function , 1955 .