On Simplex Pivoting Rules and Complexity Theory
暂无分享,去创建一个
Christos H. Papadimitriou | Ilan Adler | Aviad Rubinstein | C. Papadimitriou | I. Adler | A. Rubinstein
[1] O. H. Brownlee,et al. ACTIVITY ANALYSIS OF PRODUCTION AND ALLOCATION , 1952 .
[2] George B. Dantzig,et al. 7* A Primal-Dual Algorithm for Linear Programs , 1957 .
[3] Stanley Zionts,et al. The Criss-Cross Method for Solving Linear Programming Problems , 1969 .
[4] V. Klee,et al. HOW GOOD IS THE SIMPLEX ALGORITHM , 1970 .
[5] Richard M. Karp,et al. Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.
[6] Richard M. Karp,et al. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.
[7] Robert G. Jeroslow,et al. The simplex algorithm with the pivot rule of maximizing criterion improvement , 1973, Discret. Math..
[8] Donald Goldfarb,et al. A practicable steepest-edge simplex algorithm , 1977, Math. Program..
[9] V. Chvátal,et al. Notes on Bland’s pivoting rule , 1978 .
[10] L. G. H. Cijan. A polynomial algorithm in linear programming , 1979 .
[11] Katta G. Murty,et al. Computational complexity of parametric linear programming , 1980, Math. Program..
[12] L. Khachiyan. Polynomial algorithms in linear programming , 1980 .
[13] Nesa L'abbe Wu,et al. Linear programming and extensions , 1981 .
[14] Karl-Heinz Borgwardt,et al. The Average number of pivot steps required by the Simplex-Method is polynomial , 1982, Z. Oper. Research.
[15] Stephen Smale,et al. On the average number of steps of the simplex method of linear programming , 1983, Math. Program..
[16] Narendra Karmarkar,et al. A new polynomial-time algorithm for linear programming , 1984, Comb..
[17] Nimrod Megiddo,et al. A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension , 1985, JACM.
[18] T. Terlaky. A convergent criss-cross method , 1985 .
[19] Michael J. Todd,et al. Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems , 1986, Math. Program..
[20] Richard M. Karp,et al. A Family of Simplex Variants Solving an m × d Linear Program in Expected Number of Pivot Steps Depending on d Only , 1986, Math. Oper. Res..
[21] Éva Tardos,et al. A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs , 1986, Oper. Res..
[22] Kees Roos,et al. An exponential example for Terlaky's pivoting rule for the criss-cross simplex method , 1990, Math. Program..
[23] K. Fukuda,et al. On the finiteness of the criss-cross method , 1991 .
[24] Micha Sharir,et al. A subexponential bound for linear programming , 1992, SCG '92.
[25] G. Kalai,et al. A quasi-polynomial bound for the diameter of graphs of polyhedra , 1992, math/9204233.
[26] Richard W. Cottle,et al. Linear Complementarity Problem. , 1992 .
[27] Gil Kalai,et al. A subexponential randomized simplex algorithm (extended abstract) , 1992, STOC '92.
[28] N. Amenta,et al. Deformed products and maximal shadows of polytopes , 1996 .
[29] H. Kuk. On equilibrium points in bimatrix games , 1996 .
[30] Q. Zhang. A NEW POLYNOMIAL-TIME ALGORITHM FOR LP , 1996 .
[31] Shang-Hua Teng,et al. Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time , 2001, STOC '01.
[32] Rahul Savani,et al. Hard‐to‐Solve Bimatrix Games , 2006 .
[33] Francisco Santos,et al. A counterexample to the Hirsch conjecture , 2010, ArXiv.
[34] Paul W. Goldberg,et al. The Complexity of the Homotopy Method, Equilibrium Selection, and Lemke-Howson Solutions , 2010, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[35] Salil P. Vadhan,et al. Computational Complexity , 2005, Encyclopedia of Cryptography and Security.
[36] Yinyu Ye,et al. The Simplex and Policy-Iteration Methods Are Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate , 2011, Math. Oper. Res..
[37] Sergei Chubanov. A strongly polynomial algorithm for linear systems having a binary solution , 2012, Math. Program..