???????

?_????W????????????@?@ ???\??W?@?@ ??????

?_????W

?w??_??

?u???????v??????鑽?????????@??????v?C???m?i???H?w?j?D
??????w ??w?@???H?w?n?????? ???????w??U ???m????C2004?N3???D
?卸?F????m?? ???????i?????C?? ?????H???w ?????j

????t?_???E????

R. Miyashiro, T. Matsui: Notes on equitable round-robin tournaments. IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences, E85-A (2002), 1006-1010.
R. Miyashiro, H. Iwasaki, T. Matsui: Characterizing feasible pattern sets with a minimum number of breaks. Selected Revised Papers from the 4th International Conference on the Practice and Theory of Automated Timetabling, Lecture Notes in Computer Science, 2740 (2003), Springer, 78-99. doi:10.1007/978-3-540-45157-0_5
R. Miyashiro, T. Matsui: A polynomial-time algorithm to find an equitable home-away assignment. Operations Research Letters, 33 (2005), 235-241. doi:10.1016/j.orl.2004.06.004
A. Suzuka, R. Miyashiro, A. Yoshise, T. Matsui: Semidefinite programming based approaches to home-away assignment problems in sports scheduling. The First International Conference on Algorithmic Applications in Management, Lecture Notes in Computer Science, 3521 (2005), Springer, 95-103. doi:10.1007/11496199_12
?[??e?O?C?{?????C???X?????Y?F ??????I?????u???????f?B?X?g?[?V?????v????????x???D ?????H?w???C71 (2005), 1410-1414. doi:10.2493/jspe.71.1410
A. Suzuka, R. Miyashiro, A. Yoshise, T. Matsui: Dependent randomized rounding to the home-away assignment problem in sports scheduling. IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences, E89-A (2006), 1407-1416. doi:10.1093/ietfec/e89-a.5.1407
R. Miyashiro, T. Matsui: Semidefinite programming based approaches to the break minimization problem. Computers and Operations Research, 33 (2006), 1975-1982. doi:10.1016/j.cor.2004.09.030
?[??e?O?C?{?????C???X?????Y?F ??????I?????u???????d????????????D ?????H?w???C72 (2006), 1291-1295. doi:10.2493/jspe.72.1291
A. Suzuka, R. Miyashiro, A. Yoshise, T. Matsui: The home-away assignment problems and break minimization/maximization problems in sports scheduling. Pacific Journal of Optimization, 3 (2007), 113-133.
N. Fujiwara, S. Imahori, T. Matsui, R. Miyashiro: Constructive algorithms for the constant distance traveling tournament problem. Selected Revised Papers from the 6th International Conference on the Practice and Theory of Automated Timetabling, Lecture Notes in Computer Science, 3867 (2007), 135-146. doi:10.1007/978-3-540-77345-0_9
?{?????C???m???C???????a?F ?????????A??????l?????āD ?????w??_?????C48 (2007), 3463-3469?D
?{???i?????j?_?q?C?i??E???C?{?????C????????F ???}????@??????镪?}???I????????v?Z??????????D ?????w??_???? ???????f????????p?C2 (2009), 103-112.
R. Miyashiro, Y. Fukagawa: Optimization of alignment in semiconductor lithography equipment. Precision Engineering, 33 (2009), 327-332. doi:10.1016/j.precisioneng.2008.09.001
Y. Shinano, T. Yoshihara, R. Miyashiro, Y. Fukagawa: Optimization of lens adjustment in semiconductor lithography equipment using quadratically constrained and second-order cone programming. Journal of Advanced Mechanical Design, Systems, and Manufacturing, 4 (2010), 785-793. doi:10.1299/jamdsm.4.785
D. Yamaguchi, S. Imahori, R. Miyashiro, T. Matsui: An improved approximation algorithm for the traveling tournament problem. Algorithmica, 61 (2011), 1077-1091. doi:10.1007/s00453-011-9579-1
R. Miyashiro, S. Imahori, T. Matsui: An approximation algorithm for the traveling tournament problem. Annals of Operations Research, 194 (2012), 317-324. doi:10.1007/s10479-010-0742-x
K. Okada, R. Miyashiro: Optimization of assignment of rapid train stops: example of the JR Nambu line. Journal of Advanced Mechanical Design, Systems, and Manufacturing, 6 (2012), 622-632. doi:10.1299/jamdsm.6.622
S. Imahori, T. Matsui, R. Miyashiro: A 2.75-approximation algorithm for the unconstrained traveling tournament problem, Annals of Operations Research, 218 (2014), 237-247. doi:10.1007/s10479-012-1161-y
R. Miyashiro, Y. Takano: Subset selection by Mallows' Cp: a mixed integer programming approach, Expert Systems with Applications, 42 (2015), 325-331. doi:10.1016/j.eswa.2014.07.056
R. Miyashiro, Y. Takano: Mixed integer second-order cone programming formulations for variable selection in linear regression, European Journal of Operational Research, 247 (2015), 721-731. doi:10.1016/j.ejor.2015.06.081
T. Sato, Y. Takano, R. Miyashiro, A. Yoshise: Feature subset selection for logistic regression via mixed integer optimization, Computational Optimization and Applications, 64 (2016), 865-880. doi:10.1007/s10589-016-9832-2
T. Tanaka, R. Miyashiro: Fair home-away tables in sports scheduling, Journal of Advanced Mechanical Design, Systems, and Manufacturing, 10 (2016), JAMDSM0037 (12 pages). doi:10.1299/jamdsm.2016jamdsm0037
K. Tanaka, R. Miyashiro, Y. Miyamoto: A bi-objective optimization model for designing safe walking routes for school children, Geographical Analysis, 48 (2016), 448-464. doi:10.1111/gean.12095
T. Sato, Y. Takano, R. Miyashiro: Piecewise-linear approximation for feature subset selection in a sequential logit model, Journal of the Operations Research Society of Japan, 60 (2017), 1-14. doi:10.15807/jorsj.60.1
R. Tamura, K. Kobayashi, Y. Takano, R. Miyashiro, K. Nakata, T. Matsui: Best subset selection for eliminating multicollinearity, Journal of the Operations Research Society of Japan, 60 (2017), 321-336. doi:10.15807/jorsj.60.321
K. Tanaka, R. Miyashiro, Y. Miyamoto: A layered network formulation for the safe walking route design problem, Journal of Advanced Mechanical Design, Systems, and Manufacturing, 12 (2018), JAMDSM0065 (11 pages). doi:10.1299/jamdsm.2018jamdsm0065
R. Tamura, K. Kobayashi, Y. Takano, R. Miyashiro, K. Nakata, T. Matsui: Mixed integer quadratic optimization formulations for eliminating multicollinearity based on variance inflation factor, Journal of Global Optimization, 73 (2019), 431-446. doi:10.1007/s10898-018-0713-3
M. Tano, R. Miyashiro, T. Kitahara: Steepest-edge rule and its number of simplex iterations for a nondegenerate LP, Operations Research Letters, 47 (2019), 151-156. doi:10.1016/j.orl.2019.02.003
M. Naganuma, Y. Takano, R. Miyashiro: Feature subset selection for ordered logit model via tangent-plane-based approximation, IEICE TRANSACTIONS on Information and Systems, E102-D (2019), 1046-1053. doi:10.1587/transinf.2018EDP7188
Y. Takano, R. Miyashiro: Best subset selection via cross-validation criterion, TOP, 28 (2020), 475-488. doi:10.1007/s11750-020-00538-1
????S??C?{?????F ??????????K????????`??A???f?????????I???D ???{???v?w???C50 (2021), 343-362. doi:10.11329/jjssj.50.343
Y. Suzuki, R. Miyashiro: Characterization of canonical systems with six types of coins for the change-making problem. Theoretical Computer Science, 955 (2023), 113822 (15 pages). doi:10.1016/j.tcs.2023.113822
A. Watanabe, R. Tamura, Y. Takano, R. Miyashiro: Branch-and-bound algorithm for optimal sparse canonical correlation analysis. Expert Systems with Applications, 217 (2023), 119530 (12 pages). doi:10.1016/j.eswa.2023.119530
R. Tamura, Y. Takano, R. Miyashiro: Feature subset selection for kernel SVM classification via mixed-integer optimization. IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences, in press. doi:10.1587/transfun.2023EAP1043

?w???????L??

?{?????C????m??F 1993?NJ???[?O???X?P?W???[?????O?D ?I?y???[?V?????Y?E???T?[?`?C45 (2000), 81-83.
?{?????C????????F ????Г?????D ?I?y???[?V?????Y?E???T?[?`?C49 (2004), 15-20.
?{?????F ????Г????????[?g???????D ???w?Z?~?i?[?C43-8 (2004), 10-14.
?{?????C????m??F ?X?|?[?c?X?P?W???[?????O ?\??????????S??\?D ?I?y???[?V?????Y?E???T?[?`?C50 (2005), 119-124.
?[??e?O?C?i??E???C?{?????F ?X?e?[?W?i?q??f?B?X?g?[?V??????v???D ???A???C?A???X?C17 (2006), 41-47.
?{?????C????m??F ???????????鐮???v??D ?V?X?e??/????/???C50 (2006), 363-368.
?{?????F ?????胊?[?O???O???t???_?D ?I?y???[?V?????Y?E???T?[?`?C52 (2007), 547-550.
?{?????F ?G???K???g????????D ???w?Z?~?i?[?C[?o??] 46-12 (2007), 6, [??] 47-3 (2008), 94-96.
?{?????C????m??C???@?T???F ?X?|?[?c?X?P?W???[?????O?D ???w?Z?~?i?[?C49-7 (2010), 60-64.
?{?????F ???W????????āi?????悤?????v??j?D ?I?y???[?V?????Y?E???T?[?`?C57 (2012), 174.
?{?????F ?????v??\???o?[????D ?I?y???[?V?????Y?E???T?[?`?C57 (2012), 183-189.
?{?????C????S??F ????????2?????v??@?????A???????I???D ?I?y???[?V?????Y?E???T?[?`?C59 (2014), 732-738.
?{?????F ???W????????āi???Z????`????OR?j?D ?I?y???[?V?????Y?E???T?[?`?C60 (2015), 510-511.
???R???C?{?????F ?q??@??????铋??????K???D ?I?y???[?V?????Y?E???T?[?`?C61 (2016), 686-687.
?c???????C???ь??C????S??C?{?????C???c?a?G?C????m??F ???d?????????l????????A???????I?????莮???D ?I?y???[?V?????Y?E???T?[?`?C63 (2018), 128-133.

?e?N?j?J???E???|?[?g?????甲??

?{?????C????m??F ?X?|?[?c?X?P?W???[?????O???D ??K???F???f?????O??A???S???Y??13, ???v?????????????????????|?[?g?C125 (2002), 275-289.
?{?????C????????F ????Г???????D ??16??RAMP?V???|?W?E???_???W (2004)?C???{?I?y???[?V?????Y?E???T?[?`?w??C107-117.
?{???i?????j?_?q?C?{?????C???R?m???C?i??E???C????????F ???}????@???????v?Z??????????D ?????w??????CIPSJ SIG Technical Reports, 2006-MPS-58, 27-30, March 2006.
?{???i?????j?_?q?C?i??E???C?{?????C???[????C????????F ??K????}???????????????K???I??\???O???t?????D ?????w??????CIPSJ SIG Technical Reports, 2007-MPS-63, 45-48, March 2007.
?{?????F ?X?|?[?c?X?P?W???[?????O ?\??N????W?\?D ??19??RAMP?V???|?W?E???_???W (2007)?C???{?I?y???[?V?????Y?E???T?[?`?w??C45-59.
?{?????F ???????????鐮???v?? ?\??N????W?\?D ??20??RAMP?V???|?W?E???_???W (2008)?C???{?I?y???[?V?????Y?E???T?[?`?w??C1-21.
?c??????C?{?????C?{?{?T??Y?F ???????S???????????l?b?g???[?N??v ?\???S???Z???????p?\?D ??24??RAMP?V???|?W?E???_???W (2012)?C???{?I?y???[?V?????Y?E???T?[?`?w??C1-13.
?{?????C????S??F ????????????v??@??p??????A???????I???D ??K?????b???_????p?F?????????????u???^1879, ???s??w?????????????C2014?N4???C222-229.
???ь??C????S??C?{?????C???c?a?G?F ???d?????????l????????A???????I???F??????????????l?v??@??p??????@?D ??K???A???S???Y????i?W?F???_?E???p?E?????F?????????????u???^1931, ???s??w?????????????C2015?N1???C169-183.
?_?J?r??C????S??C?{?????F ????????????v??@???????K?????????@????????D ??????K??????W?F???f??????A???S???Y???F?????????????u???^2069, ???s??w?????????????C2018?N4???C42-49.

???\??W

????y?[?W??擪????

????u??

?u????Г???????v?F?{?????C????????D ??16??RAMP?V???|?W?E???C ????s?????z?[???C2004?N10??19-20???D
?u?^?C???e?[?u?????O??????锻????????āv?F?{?????D ??3??g?????_??茤???W??C ?c??`?m??w ???L?????p?X?C2007?N2??7-8???D
?u?X?|?[?c?X?P?W???[?????O ?\??N????W?\?v?F?{?????D ??19??RAMP?V???|?W?E???C ????u???b?N?z?[???????c??C2007?N10??25-26???D
?u???????????鐮???v?? ?\??N????W?\?v?F?{?????D ??20??RAMP?V???|?W?E???C ?????H???w?C2008?N10??30-31???D
?u???l?N????X???v?F?{?????D ???{?I?y???[?V?????Y?E???T?[?`?w??u?v?Z???K????V?W?J?v????????C SCOPE??????? ?\??????S????茤?????W??2010?\?C ?}?g??w?C2010?N6??26-27???D
?u?`???[?g???A???????v??v?F?{?????D ???{?I?y???[?V?????Y?E???T?[?`?w??uOR???f?????v????????C ??茤????? KSMAP?C ???i??R???t?@?????X?Z???^?[?C2011?N8??29-31???D
?u?????v??@?`???[?g???A???F?????v??\???o?[????W?v?F?{?????D ????25?N?x ??????w?? ???w?E??????w?????w?E?Y????A?g???????[?N?V???b?v?F ??K?????[?N?V???b?v ?????v??@????W????p?C ??B??w?}?X?E?t?H?A?E?C???_?X?g?????????C2013?N5??22-23???D
?u????I?????????鐮???v??@????p?v?F?{?????D ??3?? ???w?E??????w??V?X?e????????A?g?????W??C ??B??w?}?X?E?t?H?A?E?C???_?X?g?????????C2013?N11??14???D
?u?????悤?????v??v?F?{?????D ??11??OR?w?????x???V???|?W?E???C ?E?C???N???????C2014?N9??27???D
?u?g?????悤?????v??@?v?F?{?????D ???[?N?V???b?v ???R?????????K???C ??B??w?}?X?E?t?H?A?E?C???_?X?g?????????C2014?N10??2-3???D
?u?????v???y?????v?F?{?????D ???????w?????H?w?V???|?W?E??2015?C ???????w?C2015?N11??19-20???D
?u??????K???A?v???[?`??????v?F?{?????D ?d?q????M?w??2019?N???????C ????c??w?C2019?N3??19-22???D
?u?????I?????????K???v?F?{?????D ??B?n??????????OR???????C ?I?????C???C2021?N11??13???D
?u??????K???K?C?_???X?v?F?{?????D ?X?P?W???[?????O?E?V???|?W?E??2022?C ??????w?C2022?N9??16-17???D

?????c

Note on equitable round-robin tournaments. Ryuhei Miyashiro, Tomomi Matsui: The 6th KOREA-JAPAN Joint Workshop on Algorithms and Computation (WAAC 2001), Pusan National University, Korea, June 28-29, 2001 (pp. 135-140).
Characterizing feasible pattern sets with a minimum number of breaks. Ryuhei Miyashiro, Hideya Iwasaki, Tomomi Matsui: The 4th International Conference on the Practice and Theory of Automated Timetabling (PATAT 2002), KaHo St.-Lieven, Gent, Belgium, August 21-23, 2002 (pp. 311-313).
A home-away table feasibility problem. Ryuhei Miyashiro, Tomomi Matsui: The Second Japanese-Sino Optimization Meeting (JSOM 2002), Rihga Royal Hotel Kyoto, Kyoto, Japan, September 25-27, 2002.
Characterizing feasible pattern sets with a minimum number of breaks. Ryuhei Miyashiro, Tomomi Matsui: The 18th International Symposium on Mathematical Programming (ISMP2003), Technical University of Denmark, Copenhagen, Denmark, August 18-22, 2003.
The break minimization problem is solvable in polynomial time when the optimal value is less than the number of teams. Ryuhei Miyashiro, Tomomi Matsui: The 5th International Conference on the Practice and Theory of Automated Timetabling (PATAT 2004), Sheraton Station Square Hotel, Pittsburgh, USA, August 18-20, 2004 (pp. 535-538).
Semidefinite programming based approach to the break minimization problem. Ryuhei Miyashiro, Tomomi Matsui: 2005 SIAM Conference on Optimization, City Conference Centre, Stockholm, Sweden, May 15-19, 2005.
Numerical experiences with SDP approximations for an optimal home-away-table problem. Ayami Suzuka, Ryuhei Miyashiro, Akiko Yoshise, Tomomi Matsui: 2005 SIAM Conference on Optimization, City Conference Centre, Stockholm, Sweden, May 15-19, 2005.
Recent topics in sports scheduling. Ryuhei Miyashiro, Tomomi Matsui: Japan Workshop on Graph Theory and Combinatorics 2005 (JWGT 2005), Keio University, Yokohama, Japan, June 20-24, 2005.
An algorithm of feeder arrangements and pickup sequencing of component placement machine on printed circuit board. Tsuyoshi Yamada, Ryuhei Miyashiro, Mario Nakamori: The 2005 International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA 2005), Monte Carlo Resort, Las Vegas, USA, June 27-30, 2005 (pp. 403-409).
SDP approximations for a HAT optimization in sports scheduling. Tomomi Matsui, Ayami Suzuka, Akiko Yoshise, Ryuhei Miyashiro: IFORS 2005 (International Federation of Operational Research Societies), Hilton Hawaii Village Beach Resort & Spa, Honolulu, Hawaii, July 10-15, 2005.
Home-away assignment problems in sports scheduling. Tomomi Matsui, Ryuhei Miyashiro, Ayami Suzuka, Akiko Yoshise: INFORMS Hong Kong International 2006, Sheraton Hong Kong Hotel and Towers, Hong Kong, China, June 25-28, 2006.
The traveling tournament problem with a constant distance matrix. Shinji Imahori, Nobutomo Fujiwara, Tomomi Matsui, Ryuhei Miyashiro: INFORMS Hong Kong International 2006, Sheraton Hong Kong Hotel and Towers, Hong Kong, China, June 25-28, 2006.
Minimizing carry-over effects in a round-robin tournament. Ryuhei Miyashiro, Tomomi Matsui: INFORMS Hong Kong International 2006, Sheraton Hong Kong Hotel and Towers, Hong Kong, China, June 25-28, 2006.
Constructive algorithms for the constant distance traveling tournament problem. Nobutomo Fujiwara, Shinji Imahori, Tomomi Matsui, Ryuhei Miyashiro: The 6th International Conference on the Practice and Theory of Automated Timetabling (PATAT 2006), Hotel International Brno, Brno, Czech Republic, August 30-September 1, 2006 (pp. 402-405).
Minimizing the carry-over effects value in a round-robin tournament. Ryuhei Miyashiro, Tomomi Matsui: The 6th International Conference on the Practice and Theory of Automated Timetabling (PATAT 2006), Hotel International Brno, Brno, Czech Republic, August 30-September 1, 2006 (pp. 460-463).
Combinatorial optimization in sports scheduling. Tomomi Matsui, Ryuhei Miyashiro: Asian Association for Sports Management 2006 (AASM 2006), Waseda University, Tokyo, Japan, August 30-September 2, 2006.
A semidefinite programming approach to problems in sports scheduling. Ryuhei Miyashiro: Workshop on Advances in Optimization, Tokyo Institute of Technology, Tokyo, Japan, April 19-21, 2007.
A tabu search algorithm for the traveling tournament problem. Hirotake Sumikawa, Ryuhei Miyashiro, Mario Nakamori: The 2007 International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA 2007), Monte Carlo Resort, Las Vegas, USA, June 25-28, 2007 (pp. 726-731).
Minimizing carry-over effects value in a round-robin tournament. Ryuhei Miyashiro, Tomomi Matsui: The 22nd European Conference on Operational Research (EURO 2007), University of Economics Prague, Prague, Czech Republic, July 8-11, 2007.
An approximation algorithm for the traveling tournament problem. Ryuhei Miyashiro, Tomomi Matsui, Shinji Imahori: The 7th International Conference on the Practice and Theory of Automated Timetabling (PATAT 2008), Hotel Doubletree Montreal, Montreal, Quebec, Canada, August 18-22, 2008 (4 pages in CD-ROM).
An improved approximation algorithm for the traveling tournament problem. Daisuke Yamaguchi, Shinji Imahori, Ryuhei Miyashiro, Tomomi Matsui: The 12th KOREA-JAPAN Joint Workshop on Algorithms and Computation (WAAC 2009), Kookmin University, Korea, July 4-5, 2009 (pp. 22-29).
An improved approximation algorithm for the traveling tournament problem. Daisuke Yamaguchi, Shinji Imahori, Ryuhei Miyashiro, Tomomi Matsui: The 20th International Symposium on Algorithms and Computation (ISAAC 2009), Ala Moana Hotel, Honolulu, Hawaii, USA, December 16-18, 2009 (pp. 679-688).
An approximation algorithm for the unconstrained traveling tournament problem. Shinji Imahori, Tomomi Matsui, Ryuhei Miyashiro: The 8th International Conference on the Practice and Theory of Automated Timetabling (PATAT 2010), Queen's University Belfast, Northern Ireland, United Kingdom, August 10-13, 2010 (pp. 508-512).
Some topics in sports scheduling. Ryuhei Miyashiro: Optimierungsseminar, Zuse-Institute Berlin, Berlin, Germany, December 9, 2010.
Adaptive view-dependent tree graph visualization. Hiroko Nakamura Miyamura, Satoshi Ohzahata, Yuji Shinano, Ryuhei Miyashiro: The 8th International Joint Conference on Computer Science and Software Engineering (JCSSE 2011), Mahidol University, Nakhon Pathom, Thailand, May 11-13, 2011 (pp.187-192).
Optimal assignment of rapid train stops--Example of the JR Nambu Line--. Keiya Okada, Ryuhei Miyashiro: International Symposium on Scheduling 2011 (ISS2011), Osaka University Nakanoshima Center, Osaka, Japan, July 2-4, 2011 (pp. 91-96).
A risk-minimization network flow problem for designing safe walking-routes for school children. Ken-ichi Tanaka, Ryuhei Miyashiro, Yuichiro Miyamoto: INFORMS Annual Meeting 2011, Charlotte Convention Center, Charlotte, North Carolina, USA, November 13-16, 2011.
A multi-objective minimum cost flow problem to design safe walking-routes for school children. Ken-ichi Tanaka, Ryuhei Miyashiro, Yuichiro Miyamoto: The 25th European Conference on Operational Research (EURO 2012), Radisson Blu Hotel Lietuva, Vilinius, Lithania, July 8-11, 2012.
Safe walking route design problem. Ken-ichi Tanaka, Ryuhei Miyashiro, Yuichiro Miyamoto: The 20th EURO Working Group on Locational Analysis Meeting (EWGLA XX), TOBB University of Economics and Technology, Ankara, Turkey, April 17-19, 2013 (pp. 63-64).
A bi-objective optimization model for designing safe walking routes for school children. Ken-ichi Tanaka, Ryuhei Miyashiro, Yuichiro Miyamoto: INFORMS Annual Meeting 2013, Minneapolis Convention Center, Minneapolis, USA, October 6-9, 2013.
Simulation of a park-and-ride system and train scheduling using mathematical optimization. Ryuhei Miyashiro, Yuichiro Miyamoto, Ken-ichi Tanaka, Akira Yoshioka, Masahiro Kuwahara, Keiko Shimazaki: The 20th ITS World Congress on Intelligent Transport Systems (ITS 2013), Tokyo Big Sight, Tokyo, Japan, October 14-18, 2013 (9 pages in CD-ROM).
Road infrastructure planning for CO2 reduction using mathematical optimization. Yuichiro Miyamoto, Ryuhei Miyashiro, Ken-ichi Tanaka, Ryokichi Onishi, Akira Yoshioka: The 20th ITS World Congress on Intelligent Transport Systems (ITS 2013), Tokyo Big Sight, Tokyo, Japan, October 14-18, 2013 (6 pages in CD-ROM).
Mixed integer second-order cone programming formulations for variable selection. Ryuhei Miyashiro, Yuichi Takano: SIAM Conference on Optimization 2014, Town and Country Resort & Convention Center, San Diego, California, USA, May 19-22, 2014.
Stamp rally location problems. Yuichiro Miyamoto, Ken-ichi Tanaka, Ryuhei Miyashiro: International Symposium on Locational Decision XIII (ISOLDE 13th), Partenope Conference Center/Hotel La Residenza, Naples/Capri, Italy, June 16-20, 2014 (p. 65).
A bi-objective model for designing safe walking routes for school children and its applications. Ken-ichi Tanaka, Yuichiro Miyamoto, Ryuhei Miyashiro: INFORMS Annual Meeting 2014, Hilton San Francisco Union Square & Parc 55 Wyndham, Carfornia, USA, November 9-12, 2014.
Improvement on a stepwise method in variable selection problem in linear regression. Ryuta Tamura, Ryuhei Miyashiro, Yuichi Takano: The 2015 4th ICT International Student Project Conference (ICT-ISPC 2015), Tokyo University of Agriculture and Technology, Tokyo, Japan, May 23-24, 2015 (4 pages in USB flash drive).
A fair home-away table in sports scheduling. Takahiro Tanaka, Ryuhei Miyashiro: International Symposium on Scheduling 2015 (ISS 2015), Kobe Industrial Promotion Center Convention Hall, Kobe, Japan, July 4-6, 2015 (pp. 192-197).
A mixed integer semidefinite programming approach for variable selection avoiding multicollinearity. Ryuta Tamura, Ken Kobayashi, Yuichi Takano, Ryuhei Miyashiro, Kazuhide Nakata, Tomomi Matsui: The Fifth International Conference on Continuous Optimization (ICCOPT 2016), National Graduate Institute for Policy Studies, Tokyo, Japan, August 8-11, 2016.
Relaxation of tree assumption in safe walking route design problem. Ken-ichi Tanaka, Ryuhei Miyashiro, Yuichiro Miyamoto: International Symposium on Scheduling 2017 (ISS 2017), Nanzan University, Nagoya, Japan, June 23-25, 2017 (pp. 168-173).
Solution Methods of Safe Walking Route Design Problem. Yuichiro Miyamoto, Ryuhei Miyashiro, Ken-ichi Tanaka: INFORMS Annual Meeting 2017, George R. Brown Convention Center & Hilton Americas-Houston Hotel, Texas, USA, October 22-25, 2017.
Mixed-integer quadratic optimization formulations for eliminating multicollinearity based on variance inflation factor. Ryuta Tamura, Ken Kobayashi, Yuichi Takano, Ryuhei Miyashiro, Kazuhide Nakata, Tomomi Matsui: INFORMS Annual Meeting 2017, George R. Brown Convention Center & Hilton Americas-Houston Hotel, Texas, USA, October 22-25, 2017.
On the number of simplex iterations of the steepest-edge for a nondegenerate LP. Masaya Tano, Ryuhei Miyashiro, Tomonari Kitahara: The 23rd International Symposium on Mathematical Programming (ISMP 2018), Bordeaux University, Bordeaux, France, July 1-6, 2018.
Recent advances in mixed-integer optimization approaches to feature subset selection. Yuichi Takano, Ryuhei Miyashiro: INFORMS Annual Meeting 2018, Phoenix Convention Center, Phoenix, Arizona, USA, November 4-7, 2018.
Feature subset selection for the multinomial logit model via mixed-integer optimization. Shunsuke Kamiya, Ryuhei Miyashiro, Yuichi Takano: The 22nd International Conference on Artificial Intelligence and Statistics (AISTATS 2019), LOISIR Hotel Naha, Okinawa, Japan, April 16-18, 2019 (pp. 1254-1263).
Best subset selection via cross-validation criterion. Yuichi Takano, Ryuhei Miyashiro: International Conference on Nonlinear Analysis and Convex Analysis--International Conference on Optimization: Techniques and Applications (NACA-ICOTA2019), Future University Hakodate, Hakodate, Japan, August 26-31, 2019.
Branch-and-bound algorithm for optimal sparse canonical correlation analysis. Yuichi Takano, Akihisa Watanabe, Ryuta Tamura, Ryuhei Miyashiro: INFORMS Annual Meeting 2021, Anaheim Convention Center & Virtual, California, USA, October 24-27, 2021.

?????????\?i?Z?~?i?[?????j

?X?|?[?c?X?P?W???[?????O??? ?\1993?N?i???[?O????X?P?W???[??????\?D ?????W??u??K???F???f?????O??A???S???Y???v?C ???v???????????C1999?N3??29-31???D?i?{?????C????m??j
?X?|?[?c??X?P?W???[?????O?D ????11?N?x?????挤??(B)?u?A???S???Y???H?w?v?C ?k?C????w?C1999?N9??1???D?i?{?????C????m??j
?X?|?[?c??X?P?W???[?????O?D ????11?N?x?????挤??(B)?u?A???S???Y???H?w?v?C ??????z?[??, 2000?N3??11???D?i?{?????C????m??j
?X?|?[?c?X?P?W???[?????O??? ?`1993?N???X?P?W???[?????O?`?D ???Z???Z?~?i?[?C ??????w?v???H?w???C2000?N3??18???D
????Г????????????????????D ???{?I?y???[?V?????Y?E???T?[?`?w?? 2000?N?x?H?G???????\??C ?????H???w?C2000?N9??27-28???D?i?{?????C????????C????m??j
?X?|?[?c?X?P?W???[?????O???D ?X?P?W???[?????O?w?? ?X?P?W???[?????O?E?V???|?W?E??2000, ?J???A?b?N?C?l???C2000?N10??13-14???D?i?{?????C????m??j
?u?`?u?V?~?????[?V?????v?D ??????w???w???o?c???w??C 2000?N11??24???D
????Г??????? ?\???_????H?\?D ?????w???42??v???O???~???O?E?V???|?W?E???C ?????z?e?????O???C2001?N1??9-10???D?i????????C?{?????j
???[?O???????X?P?W???[????????l?@?D ?A???S???Y?????K?? ?\??????S?????????W???\?C ?}?g??w?C2001?N5??13???D
?u?`?u???U???wA?v?D ???C??w???w???????w??C 2001?N6??14???D
Note on equitable round-robin tournaments. ???{?I?y???[?V?????Y?E???T?[?`?w?? 2001?N?x?H?G???????\??C ???R?????w?C2001?N9??12-13???D?i?{?????C????m??j
?X?|?[?c??X?P?W???[?????O ?\????????[?O??X?P?W???[???????ā\?D ???J?V???|?W?E???u?A???S???Y???H?w?v?C ???????w?C2001?N10??1-2???D?i?{?????C????m??j
?u?`?u??w?@????u?`?v?D ?????????w?H?w???o?c?H?w??C 2002?N11??20???D
HAT feasibility problem. ?t?@?J???e?B?E?Z?~?i?[?C ?}?g??w??w?@?V?X?e?????H?w??????C 2002?N12??19???D
Home-away table feasibility problem. Algorithms Seminar 2003, School of Computer Science, McGill University, Montreal, Canada, May 9, 2003.
?u?`?u?????o?X?g?v?Z?????u???v?D ??????w??w?@???H?w?n??????C 2003?N7??4???D
Home-away table feasibility problem. ???{?I?y???[?V?????Y?E???T?[?`?w?? 2003?N?x?H?G???????\??C ??????w?C2003?N9??10-11???D(Miyashiro Ryuhei, Matsui Tomomi)
?X?|?[?c?X?P?W???[?????O ?\?z?[???A?E?F?C?\????e????????\?D ?g???????w?Z?~?i?[?C ??????w?C2003?N10??10???D
?u???[?N????K???????A?v???[?`?D Seminars on Algorithms in Operations Research (SAOR), ??7??C ??????w?C2004?N3??6???D
?u???[?N????K???????A?v???[?`?D ?????W??u??K???F???f?????O??A???S???Y???v?C ???v???????????C2004?N3??15-16???D
The break minimization problem. ???{?I?y???[?V?????Y?E???T?[?`?w?? 2004?N?t?G???????\??C ????c??w?C2004?N3??17-18???D?i?{?????C????m??j
?X?|?[?c?X?P?W???[?????O?????N??W?J?D ???{?I?y???[?V?????Y?E???T?[?`?w?? ?R???s???e?[?V???????????? ??????C ???s??w?C2004?N6??25???D?i?{?????C????m??j
???i?????@??????镔?i???????????i??????肨?????i?z?????????ɑ?????@?D ???{?I?y???[?V?????Y?E???T?[?`?w?? 2005?N?t?G???????\??C ?????_?H??w?C2005?N3??16-17???D?i?R?c???j?C?{?????C???X?????Y?j
?g???^????????t?v???W?F?N?g?X?P?W???[?????O???ɑ????q???[???X?e?B?b?N???@?D ???{?I?y???[?V?????Y?E???T?[?`?w?? 2005?N?t?G???????\??C ?????_?H??w?C2005?N3??16-17???D?i???????P?C?{?????C???X?????Y?j
???[?O????K????????ɑ????SDP??a??p??????@?D ???{?I?y???[?V?????Y?E???T?[?`?w?? 2005?N?t?G???????\??C ?????_?H??w?C2005?N3??16-17???D?i?鎭?????C?{?????C?g????q?C????m??j
???[?O????K????????ɑ????SDP??a??p??????@?D ?????W??u??K???F???f?????O??A???S???Y???v, ???v???????????C2005?N3??22-24???D?i?鎭?????C?{?????C?g????q?C????m??j
??????I?????u???????f?B?X?g?[?V?????v????????x???D ?????H?w?? 2005?N?H?G???C ???s??w?C2005?N9??14-15???D?i?[??e?O?C?{?????C???X?????Y?j
????Г???????D ?n???????T?~?b?g2005 in ?}?g?C 2005?N?xGODIVA??????C ?}?g??w?C2005?N11??28???D
???????v????????Carry-Over Effect????????D ???{?I?y???[?V?????Y?E???T?[?`?w?? 2006?N?t?G???????\??C ??????w?C2006?N3??14-15???D?i?{?????C????m??j
???}????@???????v?Z??????????D ?????w?? ??58??????f?????????????????C ???C????C2006?N3??16-17???D?i?{???i?????j?_?q?C?{?????C???R?m???C?i??E???C????????j
?X?|?[?c??X?P?W???[?????O??????????????D ?d?q????M?w?? 2006?N???????C ???m???w?C2006?N3??24-27???D?i?鎭?????C?{?????C?g????q?C????m??j
??K??K?w?f?[?^??????V?X?e??VAULT. Visual Computing / ?O???t?B?N?X?? CAD ?????V???|?W?E?? 2006?C ???M??w?C?K?u??C2006?N6??22-23???D?i?{???i?????j?_?q?C????????C?i??E???C?{?????j
?X?|?[?c?X?P?W???[?????O???N??W?J?D ???{?X?|?[?c?Y??w?? ??15????C ???V????w?C?????C2006?N7??22-23???D?i?{?????C????m??j
??????I?????u???????d????????????D ?????H?w?? 2006?N?H?G???C ?F?s?{??w?C2006?N9??19-22???D?i?[??e?O?C?{?????C???X?????Y?j
??N??timetabling??????????āD ???{?I?y???[?V?????Y?E???T?[?`?w?? ?R???s???e?[?V???????????? ??????C ???s??w?C2006?N9??28???D
?X?|?[?c??X?P?W???[?????O??????I??@?D ???s??w?w?p???f?B?A?Z???^?[?Z?~?i?[?C ???s??w?C2006?N11??21???D
??K????}???????????????K???I??\???O???t?????D ?????w?? ??63??????f?????????????????C ?????C?{??C2007?N3??3-4???D?i?{???i?????j?_?q?C?i??E???C?{?????C???[????C????????j
??K??c???[?O???t??K???I?\???D Visual Computing / ?O???t?B?N?X?? CAD ?????V???|?W?E?? 2007?C ???H???w?C?????C2007?N6??23-24???D?i?{???i?????j?_?q?C?i??E???C????????C?{?????C???[????j
?????????A??????l?????āD ?????W??u???l??K??????_?????v?C ???s??w?????????????C2007?N7??18-20???D?i?{?????C???m???C???????a?j
?????????A????剻???????āD ???{?I?y???[?V?????Y?E???T?[?`?w?? ?n??50???N???? SSOR2007, ????C2007?N7??29-31???D?i?{?????C???m???C???????a?j
???????????鐮???v??D FIT2007 ??6?????w?Z?p?t?H?[?????C ??????w?C2007?N9??5-7???D?i????m??C?{?????j
?????????A????剻???D ???{?I?y???[?V?????Y?E???T?[?`?w?? 2007?N?H?G???????\??C ???????w?@??w?C2007?N9??27-28???D?i?{?????C???m???C???????a?j
????g?[?i?????g???ɑ????^?u?[?T?[?`?E?A???S???Y???D ?X?P?W???[?????O?E?V???|?W?E??2007, ???s??w?C2007?N9??29-30???D?i?Z??T?x?C?{?????C???X?????Y?j
?????????v??@?????K?p????D ???{?I?y???[?V?????Y?E???T?[?`?w?? ????20?N?x??1??OR?Z?~?i?[?C ?\???v?挤?????C2008?N8??28???D
An improved approximation algorithm for the traveling tournament problem. ?????W??u??K???F???f?????O??A???S???Y???v, ???v???????????C2009?N3??25-26???D?i?R?????C???@?T???C?{?????C????m??j
??????U?????l???????????Y????????o?X?g??K???D ???{?I?y???[?V?????Y?E???T?[?`?w?? 2009?N?H?G???????\??C ?????w?C2009?N9??9-10???D?i?{?????C?i??E???C?v??@?j?C????`???C?g???r?K?C?[??e?O?j
?u?`?u??K?????_II?v?D ??????w??w?@???H?w??????C 2009?N11??24???D
???@?I????????s?A???????l???????????Y??u????????o?X?g??K???D ?????W??u??K???F???f?????O??A???S???Y???v?C ???v???????????C2010?N3??23-24???D?i?{?????C?i??E???C?v??@?j?C????`???C?g???r?K?C?[??e?O?j
???X?N??????????????l?b?g???[?N?t???[???f??????S???Z???????p?D ?s?s??OR 2010 ???[?N?V???b?v?C ??R??w?C2010?N12??18-19???D?i?c??????C?{?????C?{?{?T??Y?j
???X?N??????????????l?b?g???[?N?t???[???f??????S???Z???????p?D ???{???p?????w?? 2011?N????????A?????\??C ?d?C??M??w?C2011?N3??7-8???D?i?c??????C?{?????C?{?{?T??Y?j
???l?b?g???[?N?f?U?C???????????BPR????????????āD ???{???p?????w?? 2011?N????????A?????\??C ?d?C??M??w?C2011?N3??7-8???D?i?{?????C?{?{?T??Y?C?c??????j
??l?????????????????Min-Sum?^??Min-Max?^??l?b?g???[?N?t???[???f??????S???Z???????p?D ???{?I?y???[?V?????Y?E???T?[?`?w?? 2011?N?H?G???????\??C ?b???w?C2011?N9??15-16???D?i?c??????C?{?????C?{?{?T??Y?j
?u?`?u??????K?????_?v?D ??q??w??w?@???H?w??????C 2011?N11??16???D
?u?`?u????Z?p??????v?D ??????w??w?@???H?w??????C 2011?N12??2???D
?D???????w?????: JR?????????D ???{?I?y???[?V?????Y?E???T?[?`?w?? 2012?N?t?G???????\??C ?h?q??w?Z?C2012?N3??27-28???D?i???c????C?{?????j
???????S???????????l?b?g???[?N??v?\???S???Z???????p?\?D ??24??RAMP?V???|?W?E???C ???k??w?C2012?N9??27-28???D?i?c??????C?{?????C?{?{?T??Y?j
?u?`?u??K?????_II?v?D ??????w??w?@???H?w??????C 2012?N11??27???D
??A?????????????I?????????K???D ???H???K???Z?~?i?[?C ?????H???w?C2013?N1??17???D
?f?[?^???R???y?e?B?V???? ??I???\?D ????24?N?x?f?[?^???R???y?e?B?V???? ????蕔??C ???{?I?y???[?V?????Y?E???T?[?`?w??E???{?f?[?^?x?[?X?w?? ??????I???\??C ?c??`?m??w?C2013?N2??23???i???R???C?{?????j?D
??K????I?????p??@?D ?????w?? ??75??S?????C ???k??w?C2013?N3??6-8???D
?f?[?^???R???y?e?B?V???? ??I???\?D ????24?N?x?f?[?^???R???y?e?B?V???? ??????C ?o?c??w?n????????A?????c??C NTT?f?[?^?L?F?Z???^?[?r???C2013?N3??25???i???R???C?{?????j?D
?u?`?u?????????_A?v?D ?c??`?m??w??w?@???H?w??????C 2013?N5??7???D
????????????v??@??p??????A???????I???D ???s??w?????????????????W??u??K?????b???_????p?v?C ???s??w?C2013?N8??29-30???D?i?{?????C????S??j
????????????v??@??p??????A???????I???D ???{???p?????w??2013?N?x?N??C ?A?N???X?????C2013?N9??9-11???D?i?{?????C????S??j
????????????v??@??p??????A???????I???D ???{?I?y???[?V?????Y?E???T?[?`?w?? 2013?N?H?G???????\??C ??????w?C2013?N9??11-12???D?i?{?????C????S??j
????????????v??@??p??????A???????I???D ???{?I?y???[?V?????Y?E???T?[?`?w?? ????????u??K??????_????p?v?C ??????w?C2013?N11??9???D
????????????v??@??p??????A???????I???D ???{?I?y???[?V?????Y?E???T?[?`?w?? ????????u?????????s????OR?v?C ???????w?@??w?C2014?N2??19???D
?f?[?^???R???y?e?B?V???? ??I???\?D ????25?N?x?f?[?^???R???y?e?B?V???? ????蕔??C ???{?I?y???[?V?????Y?E???T?[?`?w?? ??I???\??C ?c??`?m??w?C2014?N3??4???i??????C?{?????j?D
Mallows??Cp?K???????A???????I???\??????????v??@??p??????@?\?D ???{?I?y???[?V?????Y?E???T?[?`?w?? 2014?N?t?G???????\??C ????w?C2014?N3??6-7???D?i????S??C?{?????j
?X?^???v?????[?z?u???D ???{?I?y???[?V?????Y?E???T?[?`?w?? 2014?N?H?G???????\??C ?k?C????w??w?C2014?N8??28-29???D?i?{?{?T??Y?C?c??????C?{?????j
?k?????k???A??????????????g?C?????K?z?u?D ???{?I?y???[?V?????Y?E???T?[?`?w?? 2014?N?H?G???????\??C ?k?C????w??w?C2014?N8??28-29???D?i????q??C?{?????j
???d?????????l????????A???????I???\??????????????l?v??@??p??????@?\?D ???{?I?y???[?V?????Y?E???T?[?`?w?? 2014?N?H?G???????\??C ?k?C????w??w?C2014?N8??28-29???D?i???ь??C????S??C?{?????C???c?a?G?j
Mallows??Cp?K???????A???????I???F??????????v??@??p??????@?D FIT2014 ??13?????w?Z?p?t?H?[?????C ?}?g??w?C2014?N9??3-5???D?i????S??C?{?????j
???d?????????l????????A???????I???\??????????????l?v?????p??????@?\?D ???s??w?????????????????W??u??K???A???S???Y????i?W?F???_?E???p?E?????v?C ???s??w?C2014?N9??24-25???D?i???ь??C????S??C?{?????C???c?a?G?j
?q??@????????q????????K???D ???{?I?y???[?V?????Y?E???T?[?`?w?? 2015?N?t?G???????\??C ?????????w?C2015?N3??26-27???D?i???R???C?{?????j
???d?????????l????????A???????I????ɑ?????p??@?D ???{?I?y???[?V?????Y?E???T?[?`?w?? 2015?N?t?G???????\??C ?????????w?C2015?N3??26-27???D?i???ь??C????S??C?{?????C???c?a?G?j
??????????K?????郍?W?X?e?B?b?N??A???f???????I???D ???{?I?y???[?V?????Y?E???T?[?`?w?? 2015?N?t?G???????\??C ?????????w?C2015?N3??26-27???D?i?????r???C????S??C?{?????C?g????q?j
??????????K???D ??K???????Z?~?i?[?C?????C?m??w?C2015?N6??2???D
?W???J???^?????H??c?n?G???A??????铹?H?C???t???????D?揇???????D ???{?I?y???[?V?????Y?E???T?[?`?w?? 2015?N?H?G???????\??C ??B?H???w?C2015?N9??10-11???D?i????i?q?C?g?????C?{?????C?{?{?T??Y?C?c??????j
?敪???`?????p???????????W?b?g???f???????I???D ?????w?? ??78??S?????C ?c??`?m??w?C2016?N3??10-12???D?i?????r???C????S??C?{?????j
?敪???`?????p???????????W?b?g???f???????I???D ???{?I?y???[?V?????Y?E???T?[?`?w?? 2016?N?t?G???????\??C ?c??`?m??w?C2016?N3??17-18???D?i?????r???C????S??C?{?????j
?????s?S??????鍂???}???\???R?[?X????D ???{?I?y???[?V?????Y?E???T?[?`?w?? 2016?N?H?G???????\??C ?R?`??w?C2016?N9??15-16???D?i???c?q?a?C?{?????j
???d???????????????邽?????????W???I???D ???{?I?y???[?V?????Y?E???T?[?`?w?? 2017?N?t?G???????\??C ?????s???????????C2017?N3??15-17???D?i?c???????C???ь??C????S??C?{?????C???c?a?G?C????m??j
???U?g??v?????l??????????I?????????????????v??@????莮???D ???{?I?y???[?V?????Y?E???T?[?`?w?? 2017?N?t?G???????\??C ?????s???????????C2017?N3??15-17???D?i?c???????C???ь??C????S??C?{?????C???c?a?G?C????m??j
????????????v??@??p????????K?????????@????????D ???s??w?????????????????W??u??????K??????W?F???f??????A???S???Y???v?C ???s??w?C2017?N8??24-25???D?i?_?J?r??C????S??C?{?????j
?????I???ɑ???鐮???v??A?v???[?`?D ???{?I?y???[?V?????Y?E???T?[?`?w??u???U?A???S???Y??????p????_?v????????C ???s??w?C2017?N11??10???D
????????`?v????ɑ????steepest-edge?K?????????D ???{?I?y???[?V?????Y?E???T?[?`?w?? 2018?N?t?G???????\??C ???C??w?C2018?N3??15-16???D?i?c????C?{?????C?k???m?A?j
?????????????steepest-edge?K????p?????P??@??????????āD ?????W??u??K???F???f?????O??A???S???Y???v?C ???????w?@??w?C2018?N3??28-29???D?i?c????C?{?????C?k???m?A?j
?O??????@???鑽?????W?b?g???f??????????W???I???D ??K?????????p?F??????S????茤?????W??2018?C ???{?I?y???[?V?????Y?E???T?[?`?w??u??K?????????p?v????????C ?}?g??w?C2018?N6??9-10???D?i?_?J?r??C?{?????C????S??j
??????????????`?v??????????steepest-edge?K?????????D ??K?????????p?F??????S????茤?????W??2018?C ???{?I?y???[?V?????Y?E???T?[?`?w??u??K?????????p?v????????C ?}?g??w?C2018?N6??9-10???D?i?c????C?{?????C?k???m?A?j
??????K???@???鏇?????W?b?g???f???????I???D ??K?????????p?F??????S????茤?????W??2018?C ???{?I?y???[?V?????Y?E???T?[?`?w??u??K?????????p?v????????C ?}?g??w?C2018?N6??9-10???D?i?i??????C????S??C?{?????j
???????W?b?g???f??????????W???I???D ???{?I?y???[?V?????Y?E???T?[?`?w??60???N?L?O???? ?{??SSOR2018?C ????C?Q?n?C2018?N8??29??-31???D?i?_?J?r??C?{?????C????S??j
?????m?F?K???????A?????????I???D ???{?I?y???[?V?????Y?E???T?[?`?w?? 2019?N?t?G???????\??C ??t?H???w?C2019?N3??14-15???D?i????S??C?{?????j
Characterization of greedy solutions for the change-making problem with six coins. ???s??w?????????????????W??u??????K??????_?E?A???S???Y???E???p?v?C ???s??w?C2020?N8??24-25???D?i???I?n?C?{?????j
???}????@??p????????????????X?p?[?X????D ???s??w?????????????????W??u??????K??????_?E?A???S???Y???E???p?v?C ???s??w?C2020?N8??24-25???D?i?n粏??v?C?c???????C????S??C?{?????j
??????K?????F??P??莮????\???o?[???K?D ?V?X?e???\?z???????K???u???C???Вc?@?l?V?X?e???C?m?x?[?V?????Z???^?[?C ?I?????C???C2021?N3??27???D
?B??}???R?t???f????p?????T?b?J?[???????5???[?????_?U????]???D ??11??X?|?[?c?f?[?^???R???y?e?B?V?????C ?V???|?W?E???u?X?|?[?c?A?i???e?B?N?X????v??w?v?C ???{???v?w??X?|?[?c?f?[?^?T?C?G???X?????C ?I?????C???C2022?N1??8-9???D?i??????z?C?{?????j
Change-making problem??????????t???????????D ???{?I?y???[?V?????Y?E???T?[?`?w?? 2022?N?t?G???????\??C ?I?????C???C2022?N3??17-18???D?i???I?n?C?{?????j
???????????`??K??????J?[?l??SVM?????I???D ???s??w?????????????????W??u??????K???F???f???C???_?C?A???S???Y???v?C ?I?????C???C2022?N8??29-30???D?i?c???????C????S??C?{?????j
???????????`??K??????J?[?l??SVM?????I???D ???{?I?y???[?V?????Y?E???T?[?`?w?? 2023?N?t?G???????\??C ??????w?C2023?N3??7-8???D?i?c???????C????S??C?{?????j
???[?U???[?d???e??????l???????[?d?X?e?[?V???????K?z?u???f???D ???{?I?y???[?V?????Y?E???T?[?`?w?? 2023?N?H?G???????\??C ????w?@??w?C2023?N9??14-15???D?i?c????C?K?????L?C?g?????C?c??????C?{?{?T??Y?C?{?????j

??????

????y?[?W??擪????

????????

????18?`19?N?x??w????????? ??茤???i?a?j ??????\??C ??????薼?F?^?C???e?[?u????K?????????n?C?u???b?h?E?A???S???Y????\?z?D
????20?`22?N?x??w????????? ??茤???i?a?j ??????\??C ??????薼?F?i?m?E?}?C?N???G???W?j?A?????O??????鐔????K????W?J?D
????23?`25?N?x??w????????? ??茤???i?a?j ??????\??C ??????薼?F???U?I??????l?????????H?l?b?g???[?N??v???ɑ?????K???A???S???Y????J???D
????26?`28?N?x??w????????? ????I?G?茤?? ??????\??C ??????薼?F?????v??@????????I??????????D
????29?`??a???N?x??w????????? ???????i?b?j ??????\??C ??????薼?F?????I???????????U??K??????????????????v??A?v???[?`?D
??a3?`5?N?x??w????????? ???????i?b?j ??????\??C ??????薼?F???d????????]???w?W?????????????????I????@??\?z???A???f??????v?I???D
??a6?`8?N?x??w????????? ???????i?b?j ??????\??C ??????薼?F??X???K?????ɑ??????QUBO?莮????\?z??????????D

????18?`19?N?x??w????????? ???????i?b?j ???????S??C ??????薼?F?{?????e?B?A??v?Z???????p?????p?g??????K?????\???o?E?t???[?????[?N????? ?i??????\??F?i??E???j?D
????18?`19?N?x??w????????? ?G?茤?? ???????S??C ??????薼?F?X?|?[?c?X?P?W???[?????O?i??????\??F????m??j?D
????24?`25?N?x??w????????? ????I?G?茤?? ?A?g??????C ??????薼?F???S?????猩???l?b?g???[?N?t???[???f????J?????????p?i??????\??F?c??????j?D
????29?`??a???N?x??w????????? ???????i?b?j ?A?g??????C ??????薼?F??s???????????I??C??A?????????????K???E?V?~?????[?V?????V?X?e????\?z?i??????\??F????a???j?D

???c?@?l?b???b?U?????c ?????c?_?????\????? 2004?N?x ????????D
????25?N?x ???s??w???????????? ?????????i???J?^?j ??????\??C ??????薼?F??K?????b???_????p?D
????26?N?x ???s??w???????????? ?????????i???J?^?j ??????\??C ??????薼?F??K???A???S???Y????i?W?F???_?E???p?E?????D

????????????

?i???j?p?i?\?j?b?N?t?@?N?g???[?\?????[?V?????Y?C2004?`2009?N?x?C???????S??i??????\??F???X?????Y?j?D
?i???j?L???m???C2004?`2005?N?x?C???????S??i??????\??F?i??E???j?D

??????A

?{?????C?[??e?O?F ?I?????u???????@???т?f?o?C?X???????@?C ??????4789194???C2011?N7??29???D
Ryuhei Miyashiro, Youzou Fukagawa: Exposure apparatus and method, and device manufacturing method, United States Patent, 7,894,039, February 22, 2011.
?{?????C?i??E???C?[??e?O?C?v??@?j?C????`???C?g???r?K?F ?I?????u?A???????@?y?уf?o?C?X????????@?C ??????5418768???C2013?N11??29???D

????u?t???

?A?C???O??????ЁC????u?t?C2007?N12???`2008?N3???D
?A?C???O??????ЁC????u?t?C2008?N4???`2009?N3???D
?A?C???O?i???{?A?C?E?r?[?E?G????????Ёj?C????u?t?C2009?N4???`2010?N3???D
?@????w??w?@????w??????C???C?????C???m?O??????C?u?`?u?A???S???Y????f?[?^?\???v?C2008?N4???`2008?N9???D
?@????w??w?@????w??????C???C?????C???m?O??????C?u?`?u?A???S???Y????f?[?^?\???v?C2009?N4???`2009?N9???D
?g???^IT?J???Z???^?[?C?Z?p?A?h?o?C?U?[?C2009?N5???`2010?N2???D
?g???^IT?J???Z???^?[?C?Z?p?A?h?o?C?U?[?C2010?N6???`2011?N2???D
?g???^IT?J???Z???^?[?C?Z?p?A?h?o?C?U?[?C2011?N5???`2012?N2???D
?g???^IT?J???Z???^?[?C?Z?p?A?h?o?C?U?[?C2012?N6???`2013?N2???D
?g???^IT?J???Z???^?[?C?Z?p?A?h?o?C?U?[?C2013?N4???`2014?N3???D
?g???^IT?J???Z???^?[?C?Z?p?A?h?o?C?U?[?C2014?N4???`2015?N3???D
?g???^IT?J???Z???^?[?C?Z?p?A?h?o?C?U?[?C2015?N5???`2016?N3???D
?g???^IT?J???Z???^?[?C?Z?p?A?h?o?C?U?[?C2016?N5???`2017?N2???D
?g???^IT?J???Z???^?[?C?Z?p?A?h?o?C?U?[?C2018?N6???`2019?N2???D
?g???^??????C?Z?p?A?h?o?C?U?[?C2022?N9???`2023?N3???D
?g???^??????C?Z?p?A?h?o?C?U?[?C2023?N6???`2024?N3???D
??????w??w?@???H?w?n??????C????u?t?C?u?`?u?Z?@??v?v?_?v?C2010?N10???`2011?N3???D
??????w??w?@???H?w?n??????C????u?t?C?u?`?u?Z?@??v?v?_?v?C2011?N10???`2012?N3???D
??????w??w?@???H?w?n??????C????u?t?C?u?`?u?Z?@??v?v?_?v?C2012?N10???`2013?N3???D
?c??`?m??w??w?@???H?w??????C????u?t?C?W???u?`?u????????w????u?`?v?C2015?N4???`2015?N9???D

???????

International Symposium on Voronoi Diagrams in Science and Engineering (September 13-15, 2004, the University of Tokyo), Organizing Committee (Chair: Kokichi Sugihara).
???{?I?y???[?V?????Y?E???T?[?`?w?? 2005?N?t?G???????\??i2005?N3??16-17???C?????_?H??w?j?C ???s?ψ??i???s?ψ????F???K?V???j?D
???{?I?y???[?V?????Y?E???T?[?`?w?? 50???N?L?O???? ???T??[?ψ??? ??????W???ψ??? ?ψ??C 2006?N10???`2007?N1???D
Journal of the Operations Research Society of Japan, ??W?ψ??D 2007?N4???`2009?N3???D
???{?I?y???[?V?????Y?E???T?[?`?w?? ?w????W?ψ??C2011?N5???`2015?N9???D
???{?I?y???[?V?????Y?E???T?[?`?w?? 2013?N?t?G???????\??i2013?N3??5-6???C??????w?j?C ???s?ψ??i???s?ψ????F???c??Y?j?D
???{?I?y???[?V?????Y?E???T?[?`?w?? ?????v?挤?????? (RAMP), ?^?c?ψ??D 2012?N9???`?D
????25?N?x ??????w?? ???w?E??????w?????w?E?Y????A?g???????[?N?V???b?v?F??K?????[?N?V???b?v ?????v??@????W????p?i2013?N5??22-23???C??B??w?}?X?E?t?H?A?E?C???_?X?g?????????j?C?I?[?K?i?C?U?[?C2013?D
The 4th International Conference on Mathematics in Sport (June 5-7, 2013, KU Leuven, Belgium), Scientific Committee (Chair: Dries Goossens).
???s??w?????????????????W?? ??K?????b???_????p?i2013?N8??29-30???C???s??w?????????????j?C??\??C2013?D
???s??w?????????????????W?? ??K???A???S???Y????i?W?F???_?E???p?E?????i2014?N9??24-25???C???s??w?????????????j?C??\??C2014?D
???[?N?V???b?v ???R?????????K???i??B??w?}?X?E?t?H?A?E?C???_?X?g?????????j?C?I?[?K?i?C?U?[?C2014?D
Financial Chair, Steering Committee and Technical Program Committee, The 2015 4th ICT International Student Project Conference, 2014-2015.
International Program Committee, International Symposium on Scheduling 2015, 2014-2015.
Technical Program Committee, The 2016 5th ICT International Student Project Conference, 2016.
Guest Editor, Journal of Advanced Mechanical Design, Systems and Manufacturing, 2016.
Program Committee, The 2017 6th ICT International Student Project Conference, 2017.
Program Committee, International Symposium on Scheduling 2017, 2016-2017.
Technical Program Committee, The 2018 7th ICT International Student Project Conference, 2018.
???{?I?y???[?V?????Y?E???T?[?`?w??n??60???N?L?O???? ?{??SSOR 2018?C??x???ψ??C2018?D
Journal of the Operations Research Society of Japan, ??W?ψ??C2018?N5???`2023?N4???D
Program Committee, International Symposium on Scheduling 2019, 2018-2019.
Program Committee, International Symposium on Scheduling 2021, 2020-2021.
???{?I?y???[?V?????Y?E???T?[?`?w?? ??34??RAMP??????K???V???|?W?E???iRAMP2022?j?C?Z?b?V?????I?[?K?i?C?U?[?C2022?D
Program Committee, International Symposium on Scheduling 2023, 2022-2023.
Local Scientific Program Committee, 10th International Congress on Industrial and Applied Mathematics (ICIAM 2023), 2022-2023.

???

?R???????C?????w??C2002?N1???i????????F????????j?D
SSOR Best Presentation Award, ???{?I?y???[?V?????Y?E???T?[?`?w?? 50???N?L?O???? SSOR, 2007?N8???D
??????????C???{?I?y???[?V?????Y?E???T?[?`?w??C2012?N9???D
??????C????24?N?x?f?[?^???R???y?e?B?V???? ????蕔??C???{?I?y???[?V?????Y?E???T?[?`?w?? ???{?f?[?^?x?[?X?w?? ??????I???\??C2013?N2???D?i?`?[???u????????????[?????o?[?F???R???C?{????]?v???????G ??I?X?R?A3??^?Q??32?`?[???j?D
???y??C???{?I?y???[?V?????Y?E???T?[?`?w??C2022?N3???D

?w??????

???c????C?u?????I???????l???????D???????w?????\JR?????????????ā\?v?C ?D?G???\??CSCOPE???????\??????S????茤?????W??2011?\?C ???{?I?y???[?V?????Y?E???T?[?`?w??u?v?Z???K????V?W?J?v????????C2011?N5???D
???c????C?u?????I???????l???????D???????w?????v?C ?????_?H??w?H?w?????H?w?????_???C ???{?I?y???[?V?????Y?E???T?[?`?w?? ??29??w???_????C ???{?I?y???[?V?????Y?E???T?[?`?w??C 2011?N9???D
???R???C????24?N?x?f?[?^???R???y?e?B?V???? ????蕔??C???{?I?y???[?V?????Y?E???T?[?`?w?? ???{?f?[?^?x?[?X?w?? ??????I???\??C??????C2013?N2???D ?i?`?[???u????????????[?????o?[?F???R???C?{????]?v???????G ??I?X?R?A3??^?Q??32?`?[???j?D
????q??C?u?k?????k???A??????????????g?C?????K?z?u?????錤???v?C ?D?G???\??C??K??????_????p?\??????S????茤?????W??2013?\?C ???{?I?y???[?V?????Y?E???T?[?`?w??u??K??????_????p?v????????C2013?N6???D
???R???C?u?q??@????????q????????K???v?C ?w???D?G???\??C???{?I?y???[?V?????Y?E???T?[?`?w?? 2015?N?t?G???????\??C ???{?I?y???[?V?????Y?E???T?[?`?w??C2015?N3???D
?c???M??C?u?????胊?[?O?????????????z?[???A?E?F?C???蓖???\?z?v?C ?D?G???\??C??K???????t?????e?B?A?\??????S????茤?????W??2015?\?C ???{?I?y???[?V?????Y?E???T?[?`?w??u??K???????t?????e?B?A?v????????C2015?N7???D
???????S?C ??D?G?|?X?^?[??C2015?N?x?????_?H??w?H?w???E?H?w?{?w?????錤?????\??C ?????_?H??w?C2016?N1???D
???c?q?a?C?u?????s?S??????鍂???}???\???R?[?X????v?C ?D?G???\??C??K???????t?????e?B?A?\??????S????茤?????W??2016?\?C ???{?I?y???[?V?????Y?E???T?[?`?w??u??K???????t?????e?B?A?v????????C2016?N5???D
?_?J?r??C?u????????????v??@????AIC???????@????????v?C ?D?G???\??C??K???????t?????e?B?A?\??????S????茤?????W??2017?\?C ???{?I?y???[?V?????Y?E???T?[?`?w??u??K???????t?????e?B?A?v????????C2017?N5???D
?c???????C?u???d?????????l??????????I????@???āv?C ?????_?H??w??w?@?H?w?{???H?w??U?C?m?_???C ???{?I?y???[?V?????Y?E???T?[?`?w?? ??35??w???_????C ???{?I?y???[?V?????Y?E???T?[?`?w??C 2017?N9???D
?_?J?r??C?u???????W?b?g???f???????I????ɑ???鐮????K????@??\?z?v?C ?????_?H??w??w?@?H?w?{???H?w??U?C?m?_???C ???{?I?y???[?V?????Y?E???T?[?`?w?? ??37??w???_????C ???{?I?y???[?V?????Y?E???T?[?`?w??C 2019?N9???D

?L?^???

2004?N5???`6????NHK??q????????42??????????f?????C?u??c?f ?S??12000km????v???????g????[?g???? ???????? ??s????????D
?????v?????x???`?}?[?N?W MIPLIB 2003 ?? glass4 ?? roll3000 ????????????D?i2006?N7???j
Traveling Tournament Problem ??C???X?^???X CON16, CON18, CON20, CON22, CON24 ????????E???X?V???C??? CON22 ????????K?????????????D?i2006?N8???F?????L?F?C???x?T???C????m????????????j
???N???[?g??????s????T????R25?iNo. 187, 2008?N4??10?????j??C?X?|?[?c?X?P?W???[?????O??????R?????g???f??????????D
?????v?????x???`?}?[?N?W MIPLIB 2010 ??C???e?????C???X?^???X go19 ????^?????????D?i2011?N5???j

????y?[?W??擪?????@?@?g?b?v?y?[?W????