D. Avis and V. Chvatal, Notes on Bland???s pivoting rule
DOI : 10.1007/BFb0121192

R. G. Bland, D. Goldfarb, and M. J. Todd, Feature Article???The Ellipsoid Method: A Survey, Operations Research, vol.29, issue.6, pp.1039-1091, 1981.
DOI : 10.1287/opre.29.6.1039

W. Cunningham, Theoretical Properties of the Network Simplex Method, Mathematics of Operations Research, vol.4, issue.2, pp.196-208, 1979.
DOI : 10.1287/moor.4.2.196

G. B. Dantig, Linear Programming and Extensions, N.J, 1963.

G. B. Dantzig, Maximization of a linear function of variables subject to linear inequalities Activity Analysis of Production and Allocation, pp.339-347, 1951.

G. B. Dantzig, An ?-precise feasible solution to a linear program with a convexity constraint in 1/? 2 iterations independent of problem size, 1992.

M. Epelman and R. M. Freund, Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system, Mathematical Programming, pp.451-485, 2000.
DOI : 10.1007/s101070000136

J. L. Goffin, The Relaxation Method for Solving Systems of Linear Inequalities, Mathematics of Operations Research, vol.5, issue.3, pp.388-414, 1980.
DOI : 10.1287/moor.5.3.388

M. Goldwasser, A survey of linear programming in randomized subexponential time, ACM SIGACT News, vol.26, issue.2, p.96104, 1995.
DOI : 10.1145/202840.202847

M. Grötschel, L. Lovasz, and A. Schrijver, Geometric Algorithms and Combinatorial Optimization, 1988.

R. Jeroslow, The simplex algorithm with the pivot rule of maximizing criterion improvement, Discrete Mathematics, vol.4, issue.4, pp.367-377, 1973.
DOI : 10.1016/0012-365X(73)90171-4

D. B. Judin and A. S. Nemirovskii, Evaluation of the informational complexity of mathematical programming problems, Matekon Transl. Russian and East European Math. Economics, vol.13, issue.12, pp.3-24, 1976.

G. Kalai, Linear programming, the simplex algorithm and simple polytopes, Mathematical Programming, p.217233, 1997.
DOI : 10.1007/BF02614318

G. Kalai and D. J. Kleitman, A quasi-polynomial bound for the diameter\\of graphs of polyhedra, Bulletin of the American Mathematical Society, vol.26, issue.2, p.315316, 1992.
DOI : 10.1090/S0273-0979-1992-00285-9

N. Karmarkar, A new polynomial-time algorithm for linear programming, Combinatorica, vol.244, issue.S, pp.373-397, 1984.
DOI : 10.1007/BF02579150

L. G. Khachiyan, Polynomial algorithms in linear programming, USSR Computational Mathematics and Mathematical Physics, vol.20, issue.1, pp.191-194, 1979.
DOI : 10.1016/0041-5553(80)90061-0

V. Klee and G. J. Minty, How good is the simplex algorithm, pp.159-175, 1972.

J. Matou?ek, M. Sharir, and E. Welzl, A subexponential bound for linear programming, Algorithmica, vol.16, issue.4-5, p.498516, 1996.

P. Mcmullen, The maximum numbers of faces of a convex polytope, Mathematika, vol.16, issue.02, pp.179-184, 1970.
DOI : 10.1007/BF02771542

S. Mehrotra, On the Implementation of a Primal-Dual Interior Point Method, SIAM Journal on Optimization, vol.2, issue.4, pp.575-601, 1992.
DOI : 10.1137/0802028

R. D. Monteiro and I. Adler, Interior path following primal-dual algorithms. part I: Linear programming, Mathematical Programming, pp.27-41, 1989.
DOI : 10.1007/BF01587075

K. G. Murty, Computational complexity of parametric linear programming, Mathematical Programming, vol.7, issue.1, pp.213-219, 1980.
DOI : 10.1007/BF01581642

R. Seidel, The upper bound theorem for polytopes: an easy proof of its asymptotic version, Computational Geometry, vol.5, issue.2, pp.115-116, 1995.
DOI : 10.1016/0925-7721(95)00013-Y

E. Tardos, A strongly polynomial minimum cost circulation algorithm, Combinatorica, vol.257, issue.3, pp.247-255, 1985.
DOI : 10.1007/BF02579369

R. J. Vanderbei, Linear Programming: Foundations and Extensions, 2008.
DOI : 10.1057/palgrave.jors.2600987
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.111.1824

P. Wolfe, The Simplex Method for Quadratic Programming, Econometrica, vol.28, issue.1, pp.382-398, 1959.
DOI : 10.2307/1905320

S. J. Wright, Primal-Dual Interior Point Methods, SIAM, 1997.
DOI : 10.1137/1.9781611971453
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.129.5633

N. Zadeh, Theoretical efficiency and partial equivalence of minimum cost flow algorithms: A bad network problem for the simplex method, Mathematical Programming, pp.255-266, 1973.