| A primal-dual interior point algorithm for linear programming M Kojima, S Mizuno, A Yoshise Progress in Mathematical Programming: Interior-point and related methods, 29-47, 1989 | 928 | 1989 |
| On adaptive-step primal-dual interior-point algorithms for linear programming S Mizuno, MJ Todd, Y Ye Mathematics of Operations research 18 (4), 964-981, 1993 | 624 | 1993 |
| A polynomial-time algorithm for a class of linear complementarity problems M Kojima, S Mizuno, A Yoshise Mathematical programming 44, 1-26, 1989 | 551 | 1989 |
| An O (√ nL)-iteration homogeneous and self-dual linear programming algorithm Y Ye, MJ Todd, S Mizuno Mathematics of operations research 19 (1), 53-67, 1994 | 507 | 1994 |
| A primal—dual infeasible-interior-point algorithm for linear programming M Kojima, N Megiddo, S Mizuno Mathematical programming 61 (1), 263-280, 1993 | 428 | 1993 |
| An iteration potential reduction algorithm for linear complementarity problems M Kojima, S Mizuno, A Yoshise Mathematical programming 50 (1), 331-342, 1991 | 305 | 1991 |
| Polynomiality of infeasible-interior-point algorithms for linear programming S Mizuno Mathematical programming 67, 109-119, 1994 | 181 | 1994 |
| Interior point methods: current status and future directions RM Freund, S Mizuno High performance optimization, 441-466, 2000 | 127 | 2000 |
| A new continuation method for complementarity problems with uniformP-functions M Kojima, S Mizuno, T Noma Mathematical programming 43, 107-113, 1989 | 113 | 1989 |
| Limiting behavior of trajectories generated by a continuation method for monotone complementarity problems M Kojima, S Mizuno, T Noma Mathematics of Operations Research 15 (4), 662-675, 1990 | 99 | 1990 |
| Infeasible-interior-point primal-dual potential-reduction algorithms for linear programming S Mizuno, M Kojima, MJ Todd SIAM Journal on Optimization 5 (1), 52-67, 1995 | 98 | 1995 |
| A new polynomial time method for a linear complementarity problem S Mizuno Mathematical programming 56 (1), 31-43, 1992 | 98 | 1992 |
| Global and polynomial-time convergence of an infeasible-interior-point algorithm using inexact computation. S Mizuno, F Jarre Mathematical Programming 84 (1), 1999 | 74 | 1999 |
| A general framework of continuation methods for complementarity problems M Kojima, N Megiddo, S Mizuno Mathematics of Operations Research 18 (4), 945-963, 1993 | 68 | 1993 |
| Dynamic pricing and inventory management of a dual-channel supply chain under different power structures M Li, S Mizuno European Journal of Operational Research 303 (1), 273-285, 2022 | 65 | 2022 |
| A bound for the number of different basic solutions generated by the simplex method T Kitahara, S Mizuno Mathematical Programming 137, 579-586, 2013 | 62 | 2013 |
| Convergence of a class of inexact interior-point algorithms for linear programs RW Freund, F Jarre, S Mizuno Mathematics of Operations Research 24 (1), 50-71, 1999 | 62 | 1999 |
| A surface of analytic centers and primal-dual infeasible-interior-point algorithms for linear programming S Mizuno, MJ Todd, Y Ye Mathematics of Operations Research 20 (1), 135-162, 1995 | 61 | 1995 |
| High order infeasible-interior-point methods for solving sufficient linear complementarity problems J Stoer, M Wechs, S Mizuno Mathematics of Operations Research 23 (4), 832-862, 1998 | 58 | 1998 |
| Theoretical convergence of large-step primal—dual interior point algorithms for linear programming M Kojima, N Megiddo, S Mizuno Mathematical Programming 59, 1-21, 1993 | 57 | 1993 |
