共 9 条
[1]
Dantzig, Linear programming and extensions, (1963)
[2]
Hardy, Wright, An introduction to the theory of numbers, (1960)
[3]
Jeroslaw, The simplex algorithm with the pivot rule of maximizing criterion improvement, Discrete Mathematics, 4, pp. 367-378, (1973)
[4]
Klee, Minty, How good is the simplex algorithm, Inequalities-III, pp. 159-176, (1972)
[5]
Karp, Reducibility among combinatorial problems, Complexity of Computer Computation, (1972)
[6]
Papadimitriou, Steiglitz, Combinatorial Optimization Algorithms, (1978)
[7]
Pratt, Every prime has a succinct certificate, SIAM Journal on Computing, 4, 3, pp. 214-220, (1975)
[8]
Reiss, Dobkin, The complexity of linear programming, Yale Technical Report, (1976)
[9]
Zadeh, A bad network problem for simplex method and other minimum cost flow algorithms, Math. Programming, 5, 3, pp. 255-266, (1973)