| A bound for the number of different basic solutions generated by the simplex method T Kitahara, S Mizuno Mathematical Programming 137, 579-586, 2013 | 61 | 2013 |
| Klee–Minty’s LP and upper bounds for Dantzig’s simplex method T Kitahara, S Mizuno Operations Research Letters 39 (2), 88-91, 2011 | 22 | 2011 |
| An extension of Chubanov’s algorithm to symmetric cones BF Lourenço, T Kitahara, M Muramatsu, T Tsuchiya Mathematical Programming 173 (1), 117-149, 2019 | 17 | 2019 |
| An extension of Chubanov's polynomial-time linear programming algorithm to second-order cone programming T Kitahara, T Tsuchiya Optimization Methods and Software 33 (1), 1-25, 2018 | 15 | 2018 |
| On the number of solutions generated by the dual simplex method T Kitahara, S Mizuno Operations research letters 40 (3), 172-174, 2012 | 11 | 2012 |
| On the number of solutions generated by Dantzig’s simplex method for LP with bounded variables T Kitahara, T Matsui, S Mizuno Pacific journal of optimization 8 (3), 447-455, 2012 | 10 | 2012 |
| An upper bound for the number of different solutions generated by the primal simplex method with any selection rule of entering variables T Kitahara, S Mizuno Asia-Pacific Journal of operational research 30 (03), 1340012, 2013 | 9 | 2013 |
| A simple variant of the Mizuno--Todd--Ye predictor-corrector algorithm and its objective-function-free complexity T Kitahara, T Tsuchiya SIAM Journal on Optimization 23 (3), 1890-1903, 2013 | 8 | 2013 |
| A refinement of Todd’s bound for the diameter of a polyhedron N Sukegawa, T Kitahara Operations Research Letters 43 (5), 534-536, 2015 | 7 | 2015 |
| Proximity of weighted and layered least squares solutions T Kitahara, T Tsuchiya SIAM journal on matrix analysis and applications 31 (3), 1172-1186, 2010 | 7 | 2010 |
| The LP-Newton method for standard form linear programming problems T Kitahara, S Mizuno, J Shi Operations Research Letters 41 (5), 426-429, 2013 | 6 | 2013 |
| Quadratic and convex minimax classification problems T Kitahara, S Mizuno, K Nakata Journal of the Operations Research Society of Japan 51 (2), 191-201, 2008 | 5 | 2008 |
| A simple projection algorithm for linear programming problems T Kitahara, N Sukegawa Algorithmica 81, 167-178, 2019 | 4 | 2019 |
| An extension of a minimax approach to multiple classification T Kitahara, S Mizuno, K Nakata Journal of the Operations Research Society of Japan 50 (2), 123-136, 2007 | 4 | 2007 |
| Steepest-edge rule and its number of simplex iterations for a nondegenerate LP M Tano, R Miyashiro, T Kitahara Operations Research Letters 47 (3), 151-156, 2019 | 3 | 2019 |
| An oracle-based projection and rescaling algorithm for linear semi-infinite feasibility problems and its application to SDP and SOCP M Muramatsu, T Kitahara, BF Lourenço, T Okuno, T Tsuchiya arXiv preprint arXiv:1809.10340, 2018 | 3 | 2018 |
| On the number of solutions generated by the simplex method for LP T Kitahara, S Mizuno Optimization and Control Techniques and Applications, 75-90, 2014 | 3 | 2014 |
| LOWER BOUNDS FOR THE MAXIMUM NUMBER OF SOLUTIONS GENERATED BY THE SIMPLEX METHOD (< Special Issue> SCOPE (Seminar on Computation and OPtimization for new Extensions)) T Kitahara, S Mizuno Journal of the Operations Research Society of Japan 54 (4), 191-200, 2011 | 3 | 2011 |
| An approximation algorithm for the partial covering 0–1 integer program Y Takazawa, S Mizuno, T Kitahara Discrete applied mathematics 275, 126-133, 2020 | 2 | 2020 |
| The simplex method and the diameter of a 0-1 polytope T Kitahara, S Mizuno Technical Paper, Tokyo Institute of Technology, 2012 | 2 | 2012 |
