| Mixed integer quadratic optimization formulations for eliminating multicollinearity based on variance inflation factor R Tamura, K Kobayashi, Y Takano, R Miyashiro, K Nakata, T Matsui Journal of Global Optimization, 1-16, 2019 | 128 | 2019 |
| Mixed integer second-order cone programming formulations for variable selection in linear regression R Miyashiro, Y Takano European Journal of Operational Research 247 (3), 721-731, 2015 | 123 | 2015 |
| Characterizing feasible pattern sets with a minimum number of breaks R Miyashiro, H Iwasaki, T Matsui International Conference on the Practice and Theory of Automated Timetabling …, 2002 | 89 | 2002 |
| Subset selection by Mallows’ Cp: A mixed integer programming approach R Miyashiro, Y Takano Expert Systems with Applications 42 (1), 325-331, 2015 | 86 | 2015 |
| Feature subset selection for logistic regression via mixed integer optimization T Sato, Y Takano, R Miyashiro, A Yoshise Computational Optimization and Applications 64, 865-880, 2016 | 77 | 2016 |
| A polynomial-time algorithm to find an equitable home–away assignment R Miyashiro, T Matsui Operations Research Letters 33 (3), 235-241, 2005 | 69 | 2005 |
| Best subset selection for eliminating multicollinearity R Tamura, K Kobayashi, Y Takano, R Miyashiro, K Nakata, T Matsui Journal of the Operations Research Society of Japan 60 (3), 321-336, 2017 | 62 | 2017 |
| Semidefinite programming based approaches to the break minimization problem R Miyashiro, T Matsui Computers & Operations Research 33 (7), 1975-1982, 2006 | 53 | 2006 |
| Minimizing the carry-over effects value in a round-robin tournament R Miyashiro, T Matsui Proceedings of the 6th International Conference on the Practice and Theory …, 2006 | 42 | 2006 |
| Best subset selection via cross-validation criterion Y Takano, R Miyashiro Top 28 (2), 475-488, 2020 | 41 | 2020 |
| An improved approximation algorithm for the traveling tournament problem D Yamaguchi, S Imahori, R Miyashiro, T Matsui Algorithmica 61 (4), 1077-1091, 2011 | 40 | 2011 |
| ここまで解ける整数計画 (< 特集号> 堅く柔らかく… 数理計画アプローチ再訪) 宮代隆平， 松井知己 システム/制御/情報 50 (9), 363-368, 2006 | 36 | 2006 |
| An approximation algorithm for the traveling tournament problem R Miyashiro, T Matsui, S Imahori Annals of Operations Research 194, 317-324, 2012 | 35 | 2012 |
| A 2.75-approximation algorithm for the unconstrained traveling tournament problem S Imahori, T Matsui, R Miyashiro Annals of Operations Research 218 (1), 237-247, 2014 | 33 | 2014 |
| Piecewise-linear approximation for feature subset selection in a sequential logit model T Sato, Y Takano, R Miyashiro Journal of the Operations Research Society of Japan 60 (1), 1-14, 2017 | 32 | 2017 |
| Constructive algorithms for the constant distance traveling tournament problem N Fujiwara, S Imahori, T Matsui, R Miyashiro Practice and Theory of Automated Timetabling VI: 6th International …, 2007 | 28 | 2007 |
| 整数計画ソルバー入門 宮代隆平 オペレーションズ・リサーチ 57 (4), 183-189, 2012 | 18 | 2012 |
| The home-away assignment problems and break minimization/maximization problems in sports scheduling A Suzuka, R Miyashiro, A Yoshise, T Matsui University of Tsukuba. Graduate School of Systems and Information …, 2006 | 16 | 2006 |
| Round-robin tournaments with a small number of breaks R Miyashiro, T Matsui Department of Mathematical Informatics, The University of Tokyo …, 2003 | 16 | 2003 |
| Optimization of alignment in semiconductor lithography equipment R Miyashiro, Y Fukagawa Precision engineering 33 (4), 327-332, 2009 | 14 | 2009 |
Tomomi MatsuiTokyo Institute of Technology在 m.titech.ac.jp 的电子邮件经过验证
