1. Dantzig, G.B.: Linear Programming and Extensions. RAND Corporation, Santa Monica (1963)
2. Klee, V., Minty, G.: How Good is the Simplex Algorithm. In Equalities. Academic Press, New York (1972)
3. Terlaky, T.: A finite crisscross method for oriented matroids. J. Comb. Theory B 42(3), 319–327 (1987)
4. Pan, P.: A new perturbation simplex algorithm for linear programming. J. Comput. Math. 17(3), 233–242 (1999)
5. Pan, P.: Primal perturbation simplex algorithms for linear programming. J. Comput. Math. 18(6), 587–596 (2000)