尋媶嬈愌

榑暥娭學

妛埵榑暥

嵏撉晅榑暥丒挊彂

1. 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.
2. 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
3. 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
4. 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
5. 怺愳梕嶰丆媨戙棽暯丆拞怷崃棟梇丗 敿摫懱業岝憰抲偵偍偗傞僨傿僗僩乕僔儑儞寁應偺崅惛搙壔丏 惛枾岺妛夛帍丆71 (2005), 1410-1414. doi:10.2493/jspe.71.1410
6. 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
7. 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
8. 怺愳梕嶰丆媨戙棽暯丆拞怷崃棟梇丗 敿摫懱業岝憰抲偵偍偗傞廳偹崌偣岆嵎偺暘愅丏 惛枾岺妛夛帍丆72 (2006), 1291-1295. doi:10.2493/jspe.72.1291
9. 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.
10. 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
11. 媨戙棽暯丆栴栰梞暯丆懞徏惓榓丗 埻岄偵偍偗傞楢悢偺嵟戝抣偵偮偄偰丏 忣曬張棟妛夛榑暥帍丆48 (2007), 3463-3469丏
12. 媨懞乮拞懞乯峗巕丆昳栰桬帯丆媨戙棽暯丆嵵摗棽暥丗 暘巬尷掕朄偵偍偗傞暘巬愴棯慖戰偺偨傔偺寁嶼夁掱偺壜帇壔丏 忣曬張棟妛夛榑暥帍 悢棟儌僨儖壔偲墳梡丆2 (2009), 103-112.
13. 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
14. 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
15. 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
16. 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
17. 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
18. 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
19. 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
20. 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
21. 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
22. 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
23. 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
24. 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
25. 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
26. 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
27. 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
28. 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
29. 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
30. Y. Takano, R. Miyashiro: Best subset selection via cross-validation criterion, TOP, 28 (2020), 475-488. doi:10.1007/s11750-020-00538-1
31. 崅栰桽堦丆媨戙棽暯丗 崿崌惍悢嵟揔壔偵傛傞慄宍夞婣儌僨儖偺嵟椙曄悢慖戰丏 擔杮摑寁妛夛帍丆50 (2021), 343-362. doi:10.11329/jjssj.50.343
32. 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
33. 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
34. 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

妛夛帍偺夝愢婰帠

1. 媨戙棽暯丆徏堜抦屓丗 1993擭J儕乕僌偺嵞僗働僕儏乕儕儞僌丏 僆儁儗乕僔儑儞僘丒儕僒乕僠丆45 (2000), 81-83.
2. 媨戙棽暯丆妺惣棽栫丗 嵟挿曅摴愗晞丏 僆儁儗乕僔儑儞僘丒儕僒乕僠丆49 (2004), 15-20.
3. 媨戙棽暯丗 嵟挿曅摴愗晞偺儖乕僩傪媮傔傞丏 悢妛僙儈僫乕丆43-8 (2004), 10-14.
4. 媨戙棽暯丆徏堜抦屓丗 僗億乕僣僗働僕儏乕儕儞僌 乗枹夝寛栤戣傪拞怱偵乗丏 僆儁儗乕僔儑儞僘丒儕僒乕僠丆50 (2005), 119-124.
5. 怺愳梕嶰丆昳栰桬帯丆媨戙棽暯丗 僗僥乕僕奿巕偲僨傿僗僩乕僔儑儞偺寁應丏 岝傾儔僀傾儞僗丆17 (2006), 41-47.
6. 媨戙棽暯丆徏堜抦屓丗 偙偙傑偱夝偗傞惍悢寁夋丏 僔僗僥儉/惂屼/忣曬丆50 (2006), 363-368.
7. 媨戙棽暯丗 憤摉傝儕乕僌愴偲僌儔僼棟榑丏 僆儁儗乕僔儑儞僘丒儕僒乕僠丆52 (2007), 547-550.
8. 媨戙棽暯丗 僄儗僈儞僩側夝摎傪媮傓丏 悢妛僙儈僫乕丆[弌戣] 46-12 (2007), 6, [夝摎] 47-3 (2008), 94-96.
9. 媨戙棽暯丆徏堜抦屓丆崱孈怲帯丗 僗億乕僣僗働僕儏乕儕儞僌丏 悢妛僙儈僫乕丆49-7 (2010), 60-64.
10. 媨戙棽暯丗 摿廤偵偁偨偭偰乮偼偠傔傛偆惍悢寁夋乯丏 僆儁儗乕僔儑儞僘丒儕僒乕僠丆57 (2012), 174.
11. 媨戙棽暯丗 惍悢寁夋僜儖僶乕擖栧丏 僆儁儗乕僔儑儞僘丒儕僒乕僠丆57 (2012), 183-189.
12. 媨戙棽暯丆崅栰桽堦丗 崿崌惍悢2師悕寁夋朄偵傛傞夞婣幃偺曄悢慖戰丏 僆儁儗乕僔儑儞僘丒儕僒乕僠丆59 (2014), 732-738.
13. 媨戙棽暯丗 摿廤偵偁偨偭偰乮崅峑惗偵揱偊傞OR乯丏 僆儁儗乕僔儑儞僘丒儕僒乕僠丆60 (2015), 510-511.
14. 拞嶳棔丆媨戙棽暯丗 峲嬻婡偵偍偗傞搵忔愴棯偺嵟揔壔丏 僆儁儗乕僔儑儞僘丒儕僒乕僠丆61 (2016), 686-687.
15. 揷懞棽懢丆彫椦寬丆崅栰桽堦丆媨戙棽暯丆拞揷榓廏丆徏堜抦屓丗 懡廳嫟慄惈傪峫椂偟偨夞婣幃偺曄悢慖戰栤戣偺掕幃壔丏 僆儁儗乕僔儑儞僘丒儕僒乕僠丆63 (2018), 128-133.

僥僋僯僇儖丒儗億乕僩摍偐傜敳悎

• 媨戙棽暯丆徏堜抦屓丗 僗億乕僣僗働僕儏乕儕儞僌栤戣丏 嵟揔壔丗儌僨儕儞僌偲傾儖僑儕僘儉13, 摑寁悢棟尋媶強嫟摨尋媶儕億乕僩丆125 (2002), 275-289.
• 媨戙棽暯丆妺惣棽栫丗 嵟挿曅摴偒偭傉丏 戞16夞RAMP僔儞億僕僂儉榑暥廤 (2004)丆擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛丆107-117.
• 媨懞乮拞懞乯峗巕丆媨戙棽暯丆拞嶳抦庽丆昳栰桬帯丆嵵摗棽暥丗 暘巬尷掕朄偵偍偗傞寁嶼夁掱偺壜帇壔丏 忣曬張棟妛夛尋媶曬崘丆IPSJ SIG Technical Reports, 2006-MPS-58, 27-30, March 2006.
• 媨懞乮拞懞乯峗巕丆昳栰桬帯丆媨戙棽暯丆幍梉崅栫丆嵵摗棽暥丗 戝婯柾暘巬尷掕栘壜帇壔偺偨傔偺揔墳揑栘峔憿僌儔僼惗惉丏 忣曬張棟妛夛尋媶曬崘丆IPSJ SIG Technical Reports, 2007-MPS-63, 45-48, March 2007.
• 媨戙棽暯丗 僗億乕僣僗働僕儏乕儕儞僌 乗嬤擭偺敪揥乗丏 戞19夞RAMP僔儞億僕僂儉榑暥廤 (2007)丆擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛丆45-59.
• 媨戙棽暯丗 偙偙傑偱夝偗傞惍悢寁夋 乗嬤擭偺敪揥乗丏 戞20夞RAMP僔儞億僕僂儉榑暥廤 (2008)丆擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛丆1-21.
• 揷拞寬堦丆媨戙棽暯丆媨杮桾堦榊丗 棳傟偺埨慡惈偵拝栚偟偨僱僢僩儚乕僋愝寁 乗埨慡壓峑栤戣傊偺墳梡乗丏 戞24夞RAMP僔儞億僕僂儉榑暥廤 (2012)丆擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛丆1-13.
• 媨戙棽暯丆崅栰桽堦丗 崿崌惍悢擇師悕寁夋朄傪梡偄偨夞婣幃偺曄悢慖戰丏 嵟揔壔偺婎慴棟榑偲墳梡丗悢棟夝愅尋媶強島媶榐1879, 嫗搒戝妛悢棟夝愅尋媶強丆2014擭4寧丆222-229.
• 彫椦寬丆崅栰桽堦丆媨戙棽暯丆拞揷榓廏丗 懡廳嫟慄惈傪峫椂偟偨夞婣幃偺曄悢慖戰丗崿崌惍悢敿惓掕抣寁夋朄傪梡偄偨夝朄丏 嵟揔壔傾儖僑儕僘儉偺恑揥丗棟榑丒墳梡丒幚憰丗悢棟夝愅尋媶強島媶榐1931, 嫗搒戝妛悢棟夝愅尋媶強丆2015擭1寧丆169-183.
• 恄扟弐夘丆崅栰桽堦丆媨戙棽暯丗 崿崌惍悢擇師悕寁夋朄偵傛傞忣曬検婯弨嵟彫壔庤朄偺崅懍壔丏 悢棟嵟揔壔偺敪揥丗儌僨儖壔偲傾儖僑儕僘儉丗悢棟夝愅尋媶強島媶榐2069, 嫗搒戝妛悢棟夝愅尋媶強丆2018擭4寧丆42-49.

敪昞娭學

彽懸島墘

• 乽嵟挿曅摴偒偭傉乿丗媨戙棽暯丆妺惣棽栫丏 戞16夞RAMP僔儞億僕僂儉丆 嬥戲巗暥壔儂乕儖丆2004擭10寧19-20擔丏
• 乽僞僀儉僥乕僽儕儞僌偵偍偗傞敾掕栤戣偵偮偄偰乿丗媨戙棽暯丏 戞3夞慻崌偣榑庒庤尋媶廤夛丆 宑滀媊弇戝妛 栴忋僉儍儞僷僗丆2007擭2寧7-8擔丏
• 乽僗億乕僣僗働僕儏乕儕儞僌 乗嬤擭偺敪揥乗乿丗媨戙棽暯丏 戞19夞RAMP僔儞億僕僂儉丆 挿嶈僽儕僢僋儂乕儖崙嵺夛媍応丆2007擭10寧25-26擔丏
• 乽偙偙傑偱夝偗傞惍悢寁夋 乗嬤擭偺敪揥乗乿丗媨戙棽暯丏 戞20夞RAMP僔儞億僕僂儉丆 搶嫗岺嬈戝妛丆2008擭10寧30-31擔丏
• 乽埥俵孨偺敿乆惗乿丗媨戙棽暯丏 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛乽寁嶼偲嵟揔壔偺怴揥奐乿尋媶晹夛丆 SCOPE仐偮偔偽 乗枹棃傪扴偆庒庤尋媶幰偺廤偄2010乗丆 拀攇戝妛丆2010擭6寧26-27擔丏
• 乽僠儏乕僩儕傾儖惍悢寁夋乿丗媨戙棽暯丏 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛乽OR墶抐庒庤偺夛乿尋媶晹夛丆 庒庤尋媶岎棳夛 KSMAP丆 旡攊屛僐儞僼傽儗儞僗僙儞僞乕丆2011擭8寧29-31擔丏
• 乽惍悢寁夋朄僠儏乕僩儕傾儖丗惍悢寁夋僜儖僶乕偺敪揥乿丗媨戙棽暯丏 暯惉25擭搙 暥晹壢妛徣 悢妛丒悢棟壢妛偲彅壢妛丒嶻嬈偲偺楢実尋媶儚乕僋僔儑僢僾丗 嵟揔壔儚乕僋僔儑僢僾 惍悢寁夋朄偺敪揥偲墳梡丆 嬨廈戝妛儅僗丒僼僅傾丒僀儞僟僗僩儕尋媶強丆2013擭5寧22-23擔丏
• 乽曄悢慖戰栤戣偵偍偗傞惍悢寁夋朄偺妶梡乿丗媨戙棽暯丏 戞3夞 悢妛丒悢棟壢妛偲僔僗僥儉惂屼偲偺楢実尋媶廤夛丆 嬨廈戝妛儅僗丒僼僅傾丒僀儞僟僗僩儕尋媶強丆2013擭11寧14擔丏
• 乽偼偠傔傛偆惍悢寁夋乿丗媨戙棽暯丏 戞11夞OR妛夛拞晹巟晹僔儞億僕僂儉丆 僂僀儞僋偁偄偪丆2014擭9寧27擔丏
• 乽巊偭偰傒傛偆惍悢寁夋朄乿丗媨戙棽暯丏 儚乕僋僔儑僢僾 帺慠尵岅張棟偲嵟揔壔丆 嬨廈戝妛儅僗丒僼僅傾丒僀儞僟僗僩儕尋媶強丆2014擭10寧2-3擔丏
• 乽悢棟寁夋偺妝偟偝乿丗媨戙棽暯丏 晲憼栰戝妛悢棟岺妛僔儞億僕僂儉2015丆 晲憼栰戝妛丆2015擭11寧19-20擔丏
• 乽惍悢嵟揔壔傾僾儘乕僠傊偺擖栧乿丗媨戙棽暯丏 揹巕忣曬捠怣妛夛2019擭憤崌戝夛丆 憗堫揷戝妛丆2019擭3寧19-22擔丏
• 乽摿挜慖戰偲惍悢嵟揔壔乿丗媨戙棽暯丏 嬨廈抧嬫偵偍偗傞庒庤OR尋媶岎棳夛丆 僆儞儔僀儞丆2021擭11寧13擔丏
• 乽惍悢嵟揔壔僈僀僟儞僗乿丗媨戙棽暯丏 僗働僕儏乕儕儞僌丒僔儞億僕僂儉2022丆 拞墰戝妛丆2022擭9寧16-17擔丏

崙嵺夛媍

• 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.

崙撪偱偺敪昞乮僙儈僫乕摍娷傓乯

• 僗億乕僣僗働僕儏乕儕儞僌栤戣 乗1993擭俰儕乕僌傪嵞僗働僕儏乕儖偡傞乗丏 尋媶廤夛乽嵟揔壔丗儌僨儕儞僌偲傾儖僑儕僘儉乿丆 摑寁悢棟尋媶強丆1999擭3寧29-31擔丏乮媨戙棽暯丆徏堜抦屓乯
• 僗億乕僣偺僗働僕儏乕儕儞僌丏 暯惉11擭搙摿掕椞堟尋媶(B)乽傾儖僑儕僘儉岺妛乿丆 杒奀摴戝妛丆1999擭9寧1擔丏乮媨戙棽暯丆徏堜抦屓乯
• 僗億乕僣偺僗働僕儏乕儕儞僌丏 暯惉11擭搙摿掕椞堟尋媶(B)乽傾儖僑儕僘儉岺妛乿丆 嬥戲暥壔儂乕儖, 2000擭3寧11擔丏乮媨戙棽暯丆徏堜抦屓乯
• 僗億乕僣僗働僕儏乕儕儞僌栤戣 乣1993擭偺嵞僗働僕儏乕儕儞僌乣丏 崅峑惗僙儈僫乕丆 搶嫗戝妛寁悢岺妛晹丆2000擭3寧18擔丏
• 嵟挿曅摴偒偭傉偺尩枾夝傪媮傔傞丏 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛 2000擭搙廐婫尋媶敪昞夛丆 搶嫗岺嬈戝妛丆2000擭9寧27-28擔丏乮媨戙棽暯丆妺惣棽栫丆徏堜抦屓乯
• 僗億乕僣僗働僕儏乕儕儞僌栤戣丏 僗働僕儏乕儕儞僌妛夛 僗働僕儏乕儕儞僌丒僔儞億僕僂儉2000, 僇儕傾僢僋丆昹徏丆2000擭10寧13-14擔丏乮媨戙棽暯丆徏堜抦屓乯
• 島媊乽僔儈儏儗乕僔儑儞乿丏 暥嫵戝妛忣曬妛晹宱塩忣曬妛壢丆 2000擭11寧24擔丏
• 嵟挿曅摴偒偭傉 乗棟榑偲幚慔乗丏 忣曬張棟妛夛戞42夞僾儘僌儔儈儞僌丒僔儞億僕僂儉丆 敔崻儂僥儖彫桹墍丆2001擭1寧9-10擔丏乮妺惣棽栫丆媨戙棽暯乯
• 儕乕僌愴偺嬒摍側僗働僕儏乕儖偵娭偡傞峫嶡丏 傾儖僑儕僘儉偲嵟揔壔 乗枹棃傪扴偆尋媶幰偺廤偄乗丆 拀攇戝妛丆2001擭5寧13擔丏
• 島媊乽棧嶶悢妛A乿丏 搶奀戝妛棟妛晹忣曬悢棟妛壢丆 2001擭6寧14擔丏
• Note on equitable round-robin tournaments. 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛 2001擭搙廐婫尋媶敪昞夛丆 壀嶳棟壢戝妛丆2001擭9寧12-13擔丏乮媨戙棽暯丆徏堜抦屓乯
• 僗億乕僣偺僗働僕儏乕儕儞僌 乗岞暯側儕乕僌愴僗働僕儏乕儖偵偮偄偰乗丏 岞奐僔儞億僕僂儉乽傾儖僑儕僘儉岺妛乿丆 柤屆壆戝妛丆2001擭10寧1-2擔丏乮媨戙棽暯丆徏堜抦屓乯
• 島媊乽戝妛堾摿暿島媊乿丏 搶嫗棟壢戝妛岺妛晹宱塩岺妛壢丆 2002擭11寧20擔丏
• HAT feasibility problem. 僼傽僇儖僥傿丒僙儈僫乕丆 拀攇戝妛戝妛堾僔僗僥儉忣曬岺妛尋媶壢丆 2002擭12寧19擔丏
• Home-away table feasibility problem. Algorithms Seminar 2003, School of Computer Science, McGill University, Montreal, Canada, May 9, 2003.
• 島媊乽挻儘僶僗僩寁嶼尨棟島媶乿丏 搶嫗戝妛戝妛堾忣曬棟岺妛宯尋媶壢丆 2003擭7寧4擔丏
• Home-away table feasibility problem. 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛 2003擭搙廐婫尋媶敪昞夛丆 暉壀戝妛丆2003擭9寧10-11擔丏(Miyashiro Ryuhei, Matsui Tomomi)
• 僗億乕僣僗働僕儏乕儕儞僌 乗儂乕儉傾僂僃僀昞偺嫋梕惈敾掕栤戣乗丏 慻崌偣悢妛僙儈僫乕丆 搶嫗戝妛丆2003擭10寧10擔丏
• 僽儗乕僋悢嵟揔壔栤戣傊偺傾僾儘乕僠丏 Seminars on Algorithms in Operations Research (SAOR), 戞7夞丆 搶嫗戝妛丆2004擭3寧6擔丏
• 僽儗乕僋悢嵟揔壔栤戣傊偺傾僾儘乕僠丏 尋媶廤夛乽嵟揔壔丗儌僨儕儞僌偲傾儖僑儕僘儉乿丆 摑寁悢棟尋媶強丆2004擭3寧15-16擔丏
• The break minimization problem. 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛 2004擭弔婫尋媶敪昞夛丆 憗堫揷戝妛丆2004擭3寧17-18擔丏乮媨戙棽暯丆徏堜抦屓乯
• 僗億乕僣僗働僕儏乕儕儞僌栤戣偺嬤擭偺揥奐丏 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛 僐儞僺儏僥乕僔儑儞尋媶晹夛 尋媶夛丆 嫗搒戝妛丆2004擭6寧25擔丏乮媨戙棽暯丆徏堜抦屓乯
• 晹昳憰拝婡偵偍偗傞晹昳嫙媼晹傊偺晹昳妱摉栤戣偍傛傃晹昳媧拝弴彉栤戣偵懳偡傞夝朄丏 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛 2005擭弔婫尋媶敪昞夛丆 搶嫗擾岺戝妛丆2005擭3寧16-17擔丏乮嶳揷崉巎丆媨戙棽暯丆拞怷崃棟梇乯
• 奼挘宆帒尮惂栺晅僾儘僕僃僋僩僗働僕儏乕儕儞僌栤戣偵懳偡傞僸儏乕儕僗僥傿僢僋側夝朄丏 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛 2005擭弔婫尋媶敪昞夛丆 搶嫗擾岺戝妛丆2005擭3寧16-17擔丏乮憪晹攷婸丆媨戙棽暯丆拞怷崃棟梇乯
• 儕乕僌愴偺嵟揔夛応妱摉栤戣偵懳偡傞SDP娚榓傪梡偄偨庤朄丏 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛 2005擭弔婫尋媶敪昞夛丆 搶嫗擾岺戝妛丆2005擭3寧16-17擔丏乮楅幁弴旤丆媨戙棽暯丆媑悾復巕丆徏堜抦屓乯
• 儕乕僌愴偺嵟揔夛応妱摉栤戣偵懳偡傞SDP娚榓傪梡偄偨庤朄丏 尋媶廤夛乽嵟揔壔丗儌僨儕儞僌偲傾儖僑儕僘儉乿, 摑寁悢棟尋媶強丆2005擭3寧22-24擔丏乮楅幁弴旤丆媨戙棽暯丆媑悾復巕丆徏堜抦屓乯
• 敿摫懱業岝憰抲偵偍偗傞僨傿僗僩乕僔儑儞寁應偺崅惛搙壔丏 惛枾岺妛夛 2005擭廐婫戝夛丆 嫗搒戝妛丆2005擭9寧14-15擔丏乮怺愳梕嶰丆媨戙棽暯丆拞怷崃棟梇乯
• 嵟挿曅摴偒偭傉丏 抧棟忣曬夝愅僒儈僢僩2005 in 拀攇丆 2005擭搙GODIVA尋媶夛丆 拀攇戝妛丆2005擭11寧28擔丏
• 懳愴擔掱寁夋偵偍偗傞Carry-Over Effect嵟彫壔栤戣丏 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛 2006擭弔婫尋媶敪昞夛丆 拞墰戝妛丆2006擭3寧14-15擔丏乮媨戙棽暯丆徏堜抦屓乯
• 暘巬尷掕朄偵偍偗傞寁嶼夁掱偺壜帇壔丏 忣曬張棟妛夛 戞58夞悢棟儌僨儖壔偲栤戣夝寛尋媶夛丆 忛嶈丆暫屔丆2006擭3寧16-17擔丏乮媨懞乮拞懞乯峗巕丆媨戙棽暯丆拞嶳抦庽丆昳栰桬帯丆嵵摗棽暥乯
• 僗億乕僣偺僗働僕儏乕儕儞僌偵偍偗傞夛応妱摉栤戣丏 揹巕忣曬捠怣妛夛 2006擭憤崌戝夛丆 崙巑娳戝妛丆2006擭3寧24-27擔丏乮楅幁弴旤丆媨戙棽暯丆媑悾復巕丆徏堜抦屓乯
• 戝婯柾奒憌僨乕僞壜帇壔僔僗僥儉VAULT. Visual Computing / 僌儔僼傿僋僗偲 CAD 崌摨僔儞億僕僂儉 2006丆 搶朚戝妛丆廗巙栰丆2006擭6寧22-23擔丏乮媨懞乮拞懞乯峗巕丆嵵摗棽暥丆昳栰桬帯丆媨戙棽暯乯
• 僗億乕僣僗働僕儏乕儕儞僌偺嬤擭偺揥奐丏 擔杮僗億乕僣嶻嬈妛夛 戞15夞戝夛丆 弴揤摪戝妛丆搶嫗丆2006擭7寧22-23擔丏乮媨戙棽暯丆徏堜抦屓乯
• 敿摫懱業岝憰抲偵偍偗傞廳偹崌偣岆嵎偺暘愅丏 惛枾岺妛夛 2006擭廐婫戝夛丆 塅搒媨戝妛丆2006擭9寧19-22擔丏乮怺愳梕嶰丆媨戙棽暯丆拞怷崃棟梇乯
• 嬤擭偺timetabling偺摦岦偵偮偄偰丏 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛 僐儞僺儏僥乕僔儑儞尋媶晹夛 尋媶夛丆 嫗搒戝妛丆2006擭9寧28擔丏
• 僗億乕僣偺僗働僕儏乕儕儞僌偲悢棟揑庤朄丏 嫗搒戝妛妛弍忣曬儊僨傿傾僙儞僞乕僙儈僫乕丆 嫗搒戝妛丆2006擭11寧21擔丏
• 戝婯柾暘巬尷掕栘壜帇壔偺偨傔偺揔墳揑栘峔憿僌儔僼惗惉丏 忣曬張棟妛夛 戞63夞悢棟儌僨儖壔偲栤戣夝寛尋媶夛丆 徏搰丆媨忛丆2007擭3寧3-4擔丏乮媨懞乮拞懞乯峗巕丆昳栰桬帯丆媨戙棽暯丆幍梉崅栫丆嵵摗棽暥乯
• 戝婯柾僣儕乕僌儔僼偺揔墳揑昞帵丏 Visual Computing / 僌儔僼傿僋僗偲 CAD 崌摨僔儞億僕僂儉 2007丆 戝嶃岺嬈戝妛丆枃曽丆2007擭6寧23-24擔丏乮媨懞乮拞懞乯峗巕丆昳栰桬帯丆嵵摗棽暥丆媨戙棽暯丆幍梉崅栫乯
• 埻岄偵偍偗傞楢悢偺嵟戝抣偵偮偄偰丏 尋媶廤夛乽悢抣嵟揔壔偺棟榑偲幚嵺乿丆 嫗搒戝妛悢棟夝愅尋媶強丆2007擭7寧18-20擔丏乮媨戙棽暯丆栴栰梞暯丆懞徏惓榓乯
• 埻岄偵偍偗傞楢悢嵟戝壔栤戣偵偮偄偰丏 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛 憂棫50廃擭帠嬈 SSOR2007, 埳搶丆2007擭7寧29-31擔丏乮媨戙棽暯丆栴栰梞暯丆懞徏惓榓乯
• 偙偙傑偱夝偗傞惍悢寁夋丏 FIT2007 戞6夞忣曬壢妛媄弍僼僅乕儔儉丆 拞嫗戝妛丆2007擭9寧5-7擔丏乮徏堜抦屓丆媨戙棽暯乯
• 埻岄偵偍偗傞楢悢嵟戝壔栤戣丏 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛 2007擭廐婫尋媶敪昞夛丆 惌嶔尋媶戝妛堾戝妛丆2007擭9寧27-28擔丏乮媨戙棽暯丆栴栰梞暯丆懞徏惓榓乯
• 弰夞僩乕僫儊儞僩栤戣偵懳偡傞僞僽乕僒乕僠丒傾儖僑儕僘儉丏 僗働僕儏乕儕儞僌丒僔儞億僕僂儉2007, 嫗搒戝妛丆2007擭9寧29-30擔丏乮廧愳桾妜丆媨戙棽暯丆拞怷崃棟梇乯
• 崿崌惍悢寁夋朄偲偦偺揔梡帠椺丏 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛 暯惉20擭搙戞1夞OR僙儈僫乕丆 峔憿寁夋尋媶強丆2008擭8寧28擔丏
• An improved approximation algorithm for the traveling tournament problem. 尋媶廤夛乽嵟揔壔丗儌僨儕儞僌偲傾儖僑儕僘儉乿, 摑寁悢棟尋媶強丆2009擭3寧25-26擔丏乮嶳岥戝曘丆崱孈怲帯丆媨戙棽暯丆徏堜抦屓乯
• 岆嵎偺棧嶶惈傪峫椂偟偨儗儞僘挷惍偺儘僶僗僩嵟揔壔丏 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛 2009擭廐婫尋媶敪昞夛丆 挿嶈戝妛丆2009擭9寧9-10擔丏乮媨戙棽暯丆昳栰桬帯丆媣曐桜巎丆崅栰媊枻丆媑尨弐岾丆怺愳梕嶰乯
• 島媊乽嵟揔壔摿榑II乿丏 惉纥戝妛戝妛堾棟岺妛尋媶壢丆 2009擭11寧24擔丏
• 壛朄揑幚憰岆嵎偺晄楢懕惈傪峫椂偟偨儗儞僘娫妘挷惍偺儘僶僗僩嵟揔壔丏 尋媶廤夛乽嵟揔壔丗儌僨儕儞僌偲傾儖僑儕僘儉乿丆 摑寁悢棟尋媶強丆2010擭3寧23-24擔丏乮媨戙棽暯丆昳栰桬帯丆媣曐桜巎丆崅栰媊枻丆媑尨弐岾丆怺愳梕嶰乯
• 儕僗僋嵟彫壔偵拝栚偟偨僱僢僩儚乕僋僼儘乕儌僨儖偲埨慡壓峑栤戣傊偺墳梡丏 搒巗偺OR 2010 儚乕僋僔儑僢僾丆 撿嶳戝妛丆2010擭12寧18-19擔丏乮揷拞寬堦丆媨戙棽暯丆媨杮桾堦榊乯
• 儕僗僋嵟彫壔偵拝栚偟偨僱僢僩儚乕僋僼儘乕儌僨儖偲埨慡壓峑栤戣傊偺墳梡丏 擔杮墳梡悢棟妛夛 2011擭尋媶晹夛楢崌敪昞夛丆 揹婥捠怣戝妛丆2011擭3寧7-8擔丏乮揷拞寬堦丆媨戙棽暯丆媨杮桾堦榊乯
• 岎捠僱僢僩儚乕僋僨僓僀儞栤戣偵偍偗傞BPR娭悢偺嬤帡偵偮偄偰丏 擔杮墳梡悢棟妛夛 2011擭尋媶晹夛楢崌敪昞夛丆 揹婥捠怣戝妛丆2011擭3寧7-8擔丏乮媨戙棽暯丆媨杮桾堦榊丆揷拞寬堦乯
• 堦恖偱曕偔嫍棧偵拝栚偟偨Min-Sum宆偲Min-Max宆偺僱僢僩儚乕僋僼儘乕儌僨儖偲埨慡壓峑栤戣傊偺墳梡丏 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛 2011擭廐婫尋媶敪昞夛丆 峛撿戝妛丆2011擭9寧15-16擔丏乮揷拞寬堦丆媨戙棽暯丆媨杮桾堦榊乯
• 島媊乽悢棟嵟揔壔摿榑乿丏 忋抭戝妛戝妛堾棟岺妛尋媶壢丆 2011擭11寧16擔丏
• 島媊乽幮夛偲媄弍偺悢棟乿丏 拞墰戝妛戝妛堾棟岺妛尋媶壢丆 2011擭12寧2擔丏
• 桪摍楍幵掆幵墂偺寛掕: JR撿晲慄偺暘愅丏 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛 2012擭弔婫尋媶敪昞夛丆 杊塹戝妛峑丆2012擭3寧27-28擔丏乮壀揷壚栫丆媨戙棽暯乯
• 棳傟偺埨慡惈偵拝栚偟偨僱僢僩儚乕僋愝寁乗埨慡壓峑栤戣傊偺墳梡乗丏 戞24夞RAMP僔儞億僕僂儉丆 搶杒戝妛丆2012擭9寧27-28擔丏乮揷拞寬堦丆媨戙棽暯丆媨杮桾堦榊乯
• 島媊乽嵟揔壔摿榑II乿丏 惉纥戝妛戝妛堾棟岺妛尋媶壢丆 2012擭11寧27擔丏
• 夞婣暘愅偵偍偗傞曄悢慖戰偲悢棟嵟揔壔丏 搶岺戝嵟揔壔僙儈僫乕丆 搶嫗岺嬈戝妛丆2013擭1寧17擔丏
• 僨乕僞夝愅僐儞儁僥傿僔儑儞 嵟廔敪昞丏 暯惉24擭搙僨乕僞夝愅僐儞儁僥傿僔儑儞 壽戣愝掕晹栧丆 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛丒擔杮僨乕僞儀乕僗妛夛 崌摨嵟廔敪昞夛丆 宑滀媊弇戝妛丆2013擭2寧23擔乮拞嶳棔丆媨戙棽暯乯丏
• 嵟揔壔偺岻傒側棙梡庤朄丏 忣曬張棟妛夛 戞75夞慡崙戝夛丆 搶杒戝妛丆2013擭3寧6-8擔丏
• 僨乕僞夝愅僐儞儁僥傿僔儑儞 嵟廔敪昞丏 暯惉24擭搙僨乕僞夝愅僐儞儁僥傿僔儑儞 惉壥曬崘夛丆 宱塩壢妛宯尋媶晹夛楢崌嫤媍夛丆 NTT僨乕僞朙廎僙儞僞乕價儖丆2013擭3寧25擔乮拞嶳棔丆媨戙棽暯乯丏
• 島媊乽婎斦悢棟摿榑A乿丏 宑滀媊弇戝妛戝妛堾棟岺妛尋媶壢丆 2013擭5寧7擔丏
• 崿崌惍悢擇師悕寁夋朄傪梡偄偨夞婣幃偺曄悢慖戰丏 嫗搒戝妛悢棟夝愅尋媶強尋媶廤夛乽嵟揔壔偺婎慴棟榑偲墳梡乿丆 嫗搒戝妛丆2013擭8寧29-30擔丏乮媨戙棽暯丆崅栰桽堦乯
• 崿崌惍悢擇師悕寁夋朄傪梡偄偨夞婣幃偺曄悢慖戰丏 擔杮墳梡悢棟妛夛2013擭搙擭夛丆 傾僋儘僗暉壀丆2013擭9寧9-11擔丏乮媨戙棽暯丆崅栰桽堦乯
• 崿崌惍悢擇師悕寁夋朄傪梡偄偨夞婣幃偺曄悢慖戰丏 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛 2013擭廐婫尋媶敪昞夛丆 摽搰戝妛丆2013擭9寧11-12擔丏乮媨戙棽暯丆崅栰桽堦乯
• 崿崌惍悢擇師悕寁夋朄傪梡偄偨夞婣幃偺曄悢慖戰丏 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛 尋媶晹夛乽嵟揔壔偺棟榑偲墳梡乿丆 搶嫗戝妛丆2013擭11寧9擔丏
• 崿崌惍悢擇師悕寁夋朄傪梡偄偨夞婣幃偺曄悢慖戰丏 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛 尋媶晹夛乽惌帯偲幮夛偲峴惌偺OR乿丆 惌嶔尋媶戝妛堾戝妛丆2014擭2寧19擔丏
• 僨乕僞夝愅僐儞儁僥傿僔儑儞 嵟廔敪昞丏 暯惉25擭搙僨乕僞夝愅僐儞儁僥傿僔儑儞 壽戣愝掕晹栧丆 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛 嵟廔敪昞夛丆 宑滀媊弇戝妛丆2014擭3寧4擔乮拞懞浢丆媨戙棽暯乯丏
• Mallows偺Cp婯弨偵傛傞夞婣幃偺曄悢慖戰乗崿崌惍悢擇師寁夋朄傪梡偄偨夝朄乗丏 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛 2014擭弔婫尋媶敪昞夛丆 戝嶃戝妛丆2014擭3寧6-7擔丏乮崅栰桽堦丆媨戙棽暯乯
• 僗僞儞僾儔儕乕攝抲栤戣丏 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛 2014擭廐婫尋媶敪昞夛丆 杒奀摴壢妛戝妛丆2014擭8寧28-29擔丏乮媨杮桾堦榊丆揷拞寬堦丆媨戙棽暯乯
• 恔嵭帪偺搆曕婣戭幰傪懳徾偲偟偨壖愝僩僀儗偺嵟揔攝抲丏 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛 2014擭廐婫尋媶敪昞夛丆 杒奀摴壢妛戝妛丆2014擭8寧28-29擔丏乮崱堜抭戝丆媨戙棽暯乯
• 懡廳嫟慄惈傪峫椂偟偨夞婣幃偺曄悢慖戰乗崿崌惍悢敿惓掕抣寁夋朄傪梡偄偨夝朄乗丏 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛 2014擭廐婫尋媶敪昞夛丆 杒奀摴壢妛戝妛丆2014擭8寧28-29擔丏乮彫椦寬丆崅栰桽堦丆媨戙棽暯丆拞揷榓廏乯
• Mallows偺Cp婯弨偵傛傞夞婣幃偺曄悢慖戰丗崿崌惍悢擇師寁夋朄傪梡偄偨夝朄丏 FIT2014 戞13夞忣曬壢妛媄弍僼僅乕儔儉丆 拀攇戝妛丆2014擭9寧3-5擔丏乮崅栰桽堦丆媨戙棽暯乯
• 懡廳嫟慄惈傪峫椂偟偨夞婣幃偺曄悢慖戰乗崿崌惍悢敿惓掕抣寁夋栤戣傪梡偄偨夝朄乗丏 嫗搒戝妛悢棟夝愅尋媶強尋媶廤夛乽嵟揔壔傾儖僑儕僘儉偺恑揥丗棟榑丒墳梡丒幚憰乿丆 嫗搒戝妛丆2014擭9寧24-25擔丏乮彫椦寬丆崅栰桽堦丆媨戙棽暯丆拞揷榓廏乯
• 峲嬻婡偵偍偗傞忔媞搵忔愴棯偺嵟揔壔丏 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛 2015擭弔婫尋媶敪昞夛丆 搶嫗棟壢戝妛丆2015擭3寧26-27擔丏乮拞嶳棔丆媨戙棽暯乯
• 懡廳嫟慄惈傪峫椂偟偨夞婣幃偺曄悢慖戰栤戣偵懳偡傞斈梡夝朄丏 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛 2015擭弔婫尋媶敪昞夛丆 搶嫗棟壢戝妛丆2015擭3寧26-27擔丏乮彫椦寬丆崅栰桽堦丆媨戙棽暯丆拞揷榓廏乯
• 崿崌惍悢嵟揔壔偵傛傞儘僕僗僥傿僢僋夞婣儌僨儖偺曄悢慖戰丏 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛 2015擭弔婫尋媶敪昞夛丆 搶嫗棟壢戝妛丆2015擭3寧26-27擔丏乮嵅摗弐庽丆崅栰桽堦丆媨戙棽暯丆媑悾復巕乯
• 崿崌惍悢嵟揔壔丏 嵟揔壔崌摨僙儈僫乕丆搶嫗奀梞戝妛丆2015擭6寧2擔丏
• 僕儍僇儖僞搶晹岺嬈抍抧僄儕傾偵偍偗傞摴楬僀儞僼儔偺寶愝桪愭弴埵偺専摙丏 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛 2015擭廐婫尋媶敪昞夛丆 嬨廈岺嬈戝妛丆2015擭9寧10-11擔丏乮搰嶈宨巕丆媑壀尠丆媨戙棽暯丆媨杮桾堦榊丆揷拞寬堦乯
• 嬫暘慄宍嬤帡傪梡偄偨拃師儘僕僢僩儌僨儖偺曄悢慖戰丏 忣曬張棟妛夛 戞78夞慡崙戝夛丆 宑滀媊弇戝妛丆2016擭3寧10-12擔丏乮嵅摗弐庽丆崅栰桽堦丆媨戙棽暯乯
• 嬫暘慄宍嬤帡傪梡偄偨拃師儘僕僢僩儌僨儖偺曄悢慖戰丏 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛 2016擭弔婫尋媶敪昞夛丆 宑滀媊弇戝妛丆2016擭3寧17-18擔丏乮嵅摗弐庽丆崅栰桽堦丆媨戙棽暯乯
• 搶嫗搒怱偵偍偗傞崅懍儅儔僜儞僐乕僗偺愝掕丏 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛 2016擭廐婫尋媶敪昞夛丆 嶳宍戝妛丆2016擭9寧15-16擔丏乮壓揷抭榓丆媨戙棽暯乯
• 懡廳嫟慄惈傪彍嫀偡傞偨傔偺嵟椙晹暘廤崌慖戰丏 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛 2017擭弔婫尋媶敪昞夛丆 壂撽導巗挰懞帺帯夛娰丆2017擭3寧15-17擔丏乮揷懞棽懢丆彫椦寬丆崅栰桽堦丆媨戙棽暯丆拞揷榓廏丆徏堜抦屓乯
• 暘嶶奼戝梫場傪峫椂偟偨曄悢慖戰栤戣偲偦偺崿崌惍悢擇師寁夋朄偵傛傞掕幃壔丏 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛 2017擭弔婫尋媶敪昞夛丆 壂撽導巗挰懞帺帯夛娰丆2017擭3寧15-17擔丏乮揷懞棽懢丆彫椦寬丆崅栰桽堦丆媨戙棽暯丆拞揷榓廏丆徏堜抦屓乯
• 崿崌惍悢擇師悕寁夋朄傪梡偄偨忣曬検婯弨嵟彫壔庤朄偺崅懍壔丏 嫗搒戝妛悢棟夝愅尋媶強尋媶廤夛乽悢棟嵟揔壔偺敪揥丗儌僨儖壔偲傾儖僑儕僘儉乿丆 嫗搒戝妛丆2017擭8寧24-25擔丏乮恄扟弐夘丆崅栰桽堦丆媨戙棽暯乯
• 摿挜慖戰偵懳偡傞惍悢寁夋傾僾儘乕僠丏 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛乽棧嶶傾儖僑儕僘儉偺墳梡偲棟榑乿尋媶晹夛丆 嫗搒戝妛丆2017擭11寧10擔丏
• 旕戅壔側慄宍寁夋栤戣偵懳偡傞steepest-edge婯懃偺斀暅夞悢丏 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛 2018擭弔婫尋媶敪昞夛丆 搶奀戝妛丆2018擭3寧15-16擔丏乮揷栰徆栫丆媨戙棽暯丆杒尨抦廇乯
• 旕戅壔壖掕偺壓偱偺steepest-edge婯懃傪梡偄偨扨懱朄偺岠棪偵偮偄偰丏 尋媶廤夛乽嵟揔壔丗儌僨儕儞僌偲傾儖僑儕僘儉乿丆 惌嶔尋媶戝妛堾戝妛丆2018擭3寧28-29擔丏乮揷栰徆栫丆媨戙棽暯丆杒尨抦廇乯
• 奜晹嬤帡朄偵傛傞懡崁儘僕僢僩儌僨儖偺嵟椙晹暘廤崌慖戰丏 嵟揔壔偲偦偺墳梡丗枹棃傪扴偆庒庤尋媶幰偺廤偄2018丆 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛乽嵟揔壔偲偦偺墳梡乿尋媶晹夛丆 拀攇戝妛丆2018擭6寧9-10擔丏乮恄扟弐夘丆媨戙棽暯丆崅栰桽堦乯
• 戅壔偟偰偄側偄慄宍寁夋栤戣偵偍偗傞steepest-edge婯懃偺斀暅夞悢丏 嵟揔壔偲偦偺墳梡丗枹棃傪扴偆庒庤尋媶幰偺廤偄2018丆 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛乽嵟揔壔偲偦偺墳梡乿尋媶晹夛丆 拀攇戝妛丆2018擭6寧9-10擔丏乮揷栰徆栫丆媨戙棽暯丆杒尨抦廇乯
• 悢棟嵟揔壔朄偵傛傞弴彉儘僕僢僩儌僨儖偺曄悢慖戰丏 嵟揔壔偲偦偺墳梡丗枹棃傪扴偆庒庤尋媶幰偺廤偄2018丆 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛乽嵟揔壔偲偦偺墳梡乿尋媶晹夛丆 拀攇戝妛丆2018擭6寧9-10擔丏乮塱徖悙曚丆崅栰桽堦丆媨戙棽暯乯
• 懡崁儘僕僢僩儌僨儖偺嵟椙晹暘廤崌慖戰丏 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛60廃擭婰擮帠嬈 杮晹SSOR2018丆 悈忋丆孮攏丆2018擭8寧29擔-31擔丏乮恄扟弐夘丆媨戙棽暯丆崅栰桽堦乯
• 岎嵎妋擣婯弨偵傛傞夞婣幃偺嵟椙曄悢慖戰丏 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛 2019擭弔婫尋媶敪昞夛丆 愮梩岺嬈戝妛丆2019擭3寧14-15擔丏乮崅栰桽堦丆媨戙棽暯乯
• Characterization of greedy solutions for the change-making problem with six coins. 嫗搒戝妛悢棟夝愅尋媶強尋媶廤夛乽悢棟嵟揔壔偺棟榑丒傾儖僑儕僘儉丒墳梡乿丆 嫗搒戝妛丆2020擭8寧24-25擔丏乮楅栘桰攏丆媨戙棽暯乯
• 暘巬尷掕朄傪梡偄偨惓弨憡娭暘愅偺僗僷乕僗悇掕丏 嫗搒戝妛悢棟夝愅尋媶強尋媶廤夛乽悢棟嵟揔壔偺棟榑丒傾儖僑儕僘儉丒墳梡乿丆 嫗搒戝妛丆2020擭8寧24-25擔丏乮搉绮彶媣丆揷懞棽懢丆崅栰桽堦丆媨戙棽暯乯
• 惍悢嵟揔壔栤戣丗娙扨側掕幃壔偲僜儖僶乕墘廗丏 僔僗僥儉峔抸偺偨傔偺嵟揔壔島嵗丆堦斒幮抍朄恖僔僗僥儉僀僲儀乕僔儑儞僙儞僞乕丆 僆儞儔僀儞丆2021擭3寧27擔丏
• 塀傟儅儖僐僼儌僨儖傪梡偄偨僒僢僇乕偵偍偗傞5儗乕儞棟榑峌寕偺昡壙丏 戞11夞僗億乕僣僨乕僞夝愅僐儞儁僥傿僔儑儞丆 僔儞億僕僂儉乽僗億乕僣傾僫儕僥傿僋僗偲摑寁壢妛乿丆 擔杮摑寁妛夛僗億乕僣僨乕僞僒僀僄儞僗暘壢夛丆 僆儞儔僀儞丆2022擭1寧8-9擔丏乮彫椦挬梲丆媨戙棽暯乯
• Change-making problem偵娭偡傞摿挜晅偗偲偦偺堦斒壔丏 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛 2022擭弔婫尋媶敪昞夛丆 僆儞儔僀儞丆2022擭3寧17-18擔丏乮楅栘桰攏丆媨戙棽暯乯
• 崿崌惍悢慄宍嵟揔壔偵傛傞僇乕僱儖SVM偺曄悢慖戰丏 嫗搒戝妛悢棟夝愅尋媶強尋媶廤夛乽悢棟嵟揔壔丗儌僨儖丆棟榑丆傾儖僑儕僘儉乿丆 僆儞儔僀儞丆2022擭8寧29-30擔丏乮揷懞棽懢丆崅栰桽堦丆媨戙棽暯乯
• 崿崌惍悢慄宍嵟揔壔偵傛傞僇乕僱儖SVM偺曄悢慖戰丏 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛 2023擭弔婫尋媶敪昞夛丆 拞墰戝妛丆2023擭3寧7-8擔丏乮揷懞棽懢丆崅栰桽堦丆媨戙棽暯乯
• 儐乕僓暿偺廩揹嫋梕帪娫傪峫椂偟偨廩揹僗僥乕僔儑儞偺嵟揔攝抲儌僨儖丏 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛 2023擭廐婫尋媶敪昞夛丆 娭惣妛堾戝妛丆2023擭9寧14-15擔丏乮揷栰徆栫丆孠尨徆峀丆媑壀尠丆揷拞寬堦丆媨杮桾堦榊丆媨戙棽暯乯

偦偺傎偐

尋媶帒嬥

• 暯惉18乣19擭搙壢妛尋媶旓曗彆嬥 庒庤尋媶乮俛乯 尋媶戙昞幰丆 尋媶壽戣柤丗僞僀儉僥乕僽儖嵟揔壔偵偍偗傞僴僀僽儕僢僪丒傾儖僑儕僘儉偺峔抸丏
• 暯惉20乣22擭搙壢妛尋媶旓曗彆嬥 庒庤尋媶乮俛乯 尋媶戙昞幰丆 尋媶壽戣柤丗僫僲丒儅僀僋儘僄儞僕僯傾儕儞僌偵偍偗傞悢棟嵟揔壔偺揥奐丏
• 暯惉23乣25擭搙壢妛尋媶旓曗彆嬥 庒庤尋媶乮俛乯 尋媶戙昞幰丆 尋媶壽戣柤丗棧嶶揑惂栺傪峫椂偟偨摴楬僱僢僩儚乕僋愝寁栤戣偵懳偡傞嵟揔壔傾儖僑儕僘儉偺奐敪丏
• 暯惉26乣28擭搙壢妛尋媶旓曗彆嬥 挧愴揑朑夎尋媶 尋媶戙昞幰丆 尋媶壽戣柤丗悢棟寁夋朄偵傛傞摿挜慖戰偺尩枾壔丏
• 暯惉29乣椷榓尦擭搙壢妛尋媶旓曗彆嬥 婎斦尋媶乮俠乯 尋媶戙昞幰丆 尋媶壽戣柤丗旕撌側栚揑娭悢傪帩偮棧嶶嵟揔壔栤戣偵摿壔偟偨惍悢寁夋傾僾儘乕僠丏
• 椷榓3乣5擭搙壢妛尋媶旓曗彆嬥 婎斦尋媶乮俠乯 尋媶戙昞幰丆 尋媶壽戣柤丗懡廳嫟慄惈偺昡壙巜昗摑堦偵岦偗偨嵟椙摿挜慖戰庤朄偺峔抸偲夞婣儌僨儖偺摑寁揑夝愅丏
• 椷榓6乣8擭搙壢妛尋媶旓曗彆嬥 婎斦尋媶乮俠乯 尋媶戙昞幰丆 尋媶壽戣柤丗庬乆偺嵟揔壔栤戣偵懳偡傞椙偄QUBO掕幃壔偺峔抸偲偦偺摿挜夝柧丏

• 暯惉18乣19擭搙壢妛尋媶旓曗彆嬥 婎斦尋媶乮俠乯 尋媶暘扴幰丆 尋媶壽戣柤丗儃儔儞僥傿傾偺寁嶼帒尮棙梡偵傛傞斈梡慻崌偣嵟揔壔栤戣僜儖僶丒僼儗乕儉儚乕僋偺帋嶌 乮尋媶戙昞幰丗昳栰桬帯乯丏
• 暯惉18乣19擭搙壢妛尋媶旓曗彆嬥 朑夎尋媶 尋媶暘扴幰丆 尋媶壽戣柤丗僗億乕僣僗働僕儏乕儕儞僌乮尋媶戙昞幰丗徏堜抦屓乯丏
• 暯惉24乣25擭搙壢妛尋媶旓曗彆嬥 挧愴揑朑夎尋媶 楢実尋媶幰丆 尋媶壽戣柤丗埨慡惈偐傜尒偨僱僢僩儚乕僋僼儘乕儌僨儖偺奐敪偲偦偺墳梡乮尋媶戙昞幰丗揷拞寬堦乯丏
• 暯惉29乣椷榓尦擭搙壢妛尋媶旓曗彆嬥 婎斦尋媶乮俠乯 楢実尋媶幰丆 尋媶壽戣柤丗夁晄懌偺側偄岠棪揑側奀忋桝憲幚尰偺偨傔偺嵟揔壔丒僔儈儏儗乕僔儑儞僔僗僥儉偺峔抸乮尋媶戙昞幰丗彫椦榓攷乯丏

• 嵿抍朄恖俠仌俠怳嫽嵿抍 崙嵺夛媍榑暥敪昞幰彆惉 2004擭搙 彆惉懳徾幰丏
• 暯惉25擭搙 嫗搒戝妛悢棟夝愅尋媶強 嫟摨尋媶乮岞奐宆乯 尋媶戙昞幰丆 尋媶壽戣柤丗嵟揔壔偺婎慴棟榑偲墳梡丏
• 暯惉26擭搙 嫗搒戝妛悢棟夝愅尋媶強 嫟摨尋媶乮岞奐宆乯 尋媶戙昞幰丆 尋媶壽戣柤丗嵟揔壔傾儖僑儕僘儉偺恑揥丗棟榑丒墳梡丒幚憰丏

嫟摨尋媶幚愌

• 搶幣僄僱儖僊乕僔僗僥儉僘姅幃夛幮丆2024擭搙丆尋媶戙昞幰丆庴戸尋媶丗悢棟嵟揔壔僜儖僶乕嵦梡偵娭偡傞儕僗僋専摙丏

• 僷僫僜僯僢僋僼傽僋僩儕乕僜儕儏乕僔儑儞僘姅幃夛幮丆2004乣2009擭搙丆尋媶暘扴幰乮尋媶戙昞幰丗拞怷崃棟梇乯丏
• 僉儎僲儞姅幃夛幮丆2004乣2005擭搙丆尋媶暘扴幰乮尋媶戙昞幰丗昳栰桬帯乯丏

摿嫋娭楢

• 媨戙棽暯丆怺愳梕嶰丗 業岝憰抲偍傛傃曽朄側傜傃偵僨僶僀僗惢憿曽朄丆 摿嫋戞4789194崋丆2011擭7寧29擔丏
• Ryuhei Miyashiro, Youzou Fukagawa: Exposure apparatus and method, and device manufacturing method, United States Patent, 7,894,039, February 22, 2011.
• 媨戙棽暯丆昳栰桬帯丆怺愳梕嶰丆媣曐桜巎丆崅栰媊枻丆媑尨弐岾丗 業岝憰抲丄挷惍曽朄媦傃僨僶僀僗偺惢憿曽朄丆 摿嫋戞5418768崋丆2013擭11寧29擔丏

旕忢嬑島巘側偳

• 傾僀儘僌姅幃夛幮丆旕忢嬑島巘丆2007擭12寧乣2008擭3寧丏
• 傾僀儘僌姅幃夛幮丆旕忢嬑島巘丆2008擭4寧乣2009擭3寧丏
• 傾僀儘僌乮擔杮傾僀丒價乕丒僄儉姅幃夛幮乯丆旕忢嬑島巘丆2009擭4寧乣2010擭3寧丏
• 朄惌戝妛戝妛堾忣曬壢妛尋媶壢丆寭擟嫵堳丆攷巑慜婜壽掱丆島媊乽傾儖僑儕僘儉偲僨乕僞峔憿乿丆2008擭4寧乣2008擭9寧丏
• 朄惌戝妛戝妛堾忣曬壢妛尋媶壢丆寭擟嫵堳丆攷巑慜婜壽掱丆島媊乽傾儖僑儕僘儉偲僨乕僞峔憿乿丆2009擭4寧乣2009擭9寧丏
• 僩儓僞IT奐敪僙儞僞乕丆媄弍傾僪僶僀僓乕丆2009擭5寧乣2010擭2寧丏
• 僩儓僞IT奐敪僙儞僞乕丆媄弍傾僪僶僀僓乕丆2010擭6寧乣2011擭2寧丏
• 僩儓僞IT奐敪僙儞僞乕丆媄弍傾僪僶僀僓乕丆2011擭5寧乣2012擭2寧丏
• 僩儓僞IT奐敪僙儞僞乕丆媄弍傾僪僶僀僓乕丆2012擭6寧乣2013擭2寧丏
• 僩儓僞IT奐敪僙儞僞乕丆媄弍傾僪僶僀僓乕丆2013擭4寧乣2014擭3寧丏
• 僩儓僞IT奐敪僙儞僞乕丆媄弍傾僪僶僀僓乕丆2014擭4寧乣2015擭3寧丏
• 僩儓僞IT奐敪僙儞僞乕丆媄弍傾僪僶僀僓乕丆2015擭5寧乣2016擭3寧丏
• 僩儓僞IT奐敪僙儞僞乕丆媄弍傾僪僶僀僓乕丆2016擭5寧乣2017擭2寧丏
• 僩儓僞IT奐敪僙儞僞乕丆媄弍傾僪僶僀僓乕丆2018擭6寧乣2019擭2寧丏
• 僩儓僞帺摦幵丆媄弍傾僪僶僀僓乕丆2022擭9寧乣2023擭3寧丏
• 僩儓僞帺摦幵丆媄弍傾僪僶僀僓乕丆2023擭6寧乣2024擭3寧丏
• 搶嫗戝妛戝妛堾忣曬棟岺妛宯尋媶壢丆旕忢嬑島巘丆島媊乽嶼朄愝寁梫榑乿丆2010擭10寧乣2011擭3寧丏
• 搶嫗戝妛戝妛堾忣曬棟岺妛宯尋媶壢丆旕忢嬑島巘丆島媊乽嶼朄愝寁梫榑乿丆2011擭10寧乣2012擭3寧丏
• 搶嫗戝妛戝妛堾忣曬棟岺妛宯尋媶壢丆旕忢嬑島巘丆島媊乽嶼朄愝寁梫榑乿丆2012擭10寧乣2013擭3寧丏
• 宑滀媊弇戝妛戝妛堾棟岺妛尋媶壢丆旕忢嬑島巘丆廤拞島媊乽悢棟忣曬壢妛摿暿島媊乿丆2015擭4寧乣2015擭9寧丏

栶堳側偳

• International Symposium on Voronoi Diagrams in Science and Engineering (September 13-15, 2004, the University of Tokyo), Organizing Committee (Chair: Kokichi Sugihara).
• 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛 2005擭弔婫尋媶敪昞夛乮2005擭3寧16-17擔丆搶嫗擾岺戝妛乯丆 幚峴埾堳乮幚峴埾堳挿丗愳搰岾擵彆乯丏
• 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛 50廃擭婰擮帠嬈 帠揟曇嶽埾堳夛 帠椺曇曇廤彫埾堳夛 埾堳丆 2006擭10寧乣2007擭1寧丏
• Journal of the Operations Research Society of Japan, 曇廤埾堳丏 2007擭4寧乣2009擭3寧丏
• 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛 妛夛帍曇廤埾堳丆2011擭5寧乣2015擭9寧丏
• 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛 2013擭弔婫尋媶敪昞夛乮2013擭3寧5-6擔丆搶嫗戝妛乯丆 幚峴埾堳乮幚峴埾堳挿丗幒揷堦梇乯丏
• 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛 悢棟寁夋尋媶晹夛 (RAMP), 塣塩埾堳丏 2012擭9寧乣丏
• 暯惉25擭搙 暥晹壢妛徣 悢妛丒悢棟壢妛偲彅壢妛丒嶻嬈偲偺楢実尋媶儚乕僋僔儑僢僾丗嵟揔壔儚乕僋僔儑僢僾 惍悢寁夋朄偺敪揥偲墳梡乮2013擭5寧22-23擔丆嬨廈戝妛儅僗丒僼僅傾丒僀儞僟僗僩儕尋媶強乯丆僆乕僈僫僀僓乕丆2013丏
• The 4th International Conference on Mathematics in Sport (June 5-7, 2013, KU Leuven, Belgium), Scientific Committee (Chair: Dries Goossens).
• 嫗搒戝妛悢棟夝愅尋媶強尋媶廤夛 嵟揔壔偺婎慴棟榑偲墳梡乮2013擭8寧29-30擔丆嫗搒戝妛悢棟夝愅尋媶強乯丆戙昞幰丆2013丏
• 嫗搒戝妛悢棟夝愅尋媶強尋媶廤夛 嵟揔壔傾儖僑儕僘儉偺恑揥丗棟榑丒墳梡丒幚憰乮2014擭9寧24-25擔丆嫗搒戝妛悢棟夝愅尋媶強乯丆戙昞幰丆2014丏
• 儚乕僋僔儑僢僾 帺慠尵岅張棟偲嵟揔壔乮嬨廈戝妛儅僗丒僼僅傾丒僀儞僟僗僩儕尋媶強乯丆僆乕僈僫僀僓乕丆2014丏
• 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.
• 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛憂棫60廃擭婰擮帠嬈 杮晹SSOR 2018丆岎棳巟墖埾堳丆2018丏
• Journal of the Operations Research Society of Japan, 曇廤埾堳丆2018擭5寧乣2023擭4寧丏
• Program Committee, International Symposium on Scheduling 2019, 2018-2019.
• Program Committee, International Symposium on Scheduling 2021, 2020-2021.
• 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛 戞34夞RAMP悢棟嵟揔壔僔儞億僕僂儉乮RAMP2022乯丆僙僢僔儑儞僆乕僈僫僀僓乕丆2022丏
• 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.

庴徿

• 嶳撪彠椼徿丆忣曬張棟妛夛丆2002擭1寧乮嫟摨庴徿幰丗妺惣棽栫乯丏
• SSOR Best Presentation Award, 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛 50廃擭婰擮帠嬈 SSOR, 2007擭8寧丏
• 尋媶徿彠椼徿丆擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛丆2012擭9寧丏
• 姼摤徿丆暯惉24擭搙僨乕僞夝愅僐儞儁僥傿僔儑儞 壽戣愝掕晹栧丆擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛 擔杮僨乕僞儀乕僗妛夛 崌摨嵟廔敪昞夛丆2013擭2寧丏乮僠乕儉乽偺偆偙偆偍傉偲[儊儞僶乕丗拞嶳棔丆媨戙棽暯]乿偲偟偰庴徿丟 嵟廔僗僐傾3埵乛嶲壛32僠乕儉乯丏
• 晛媦徿丆擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛丆2022擭3寧丏

妛惗偺庴徿

• 壀揷壚栫丆乽尰幚揑側惂栺傪峫椂偟偨桪摍楍幵掆幵墂偺寛掕乗JR撿晲慄傪幚椺偲偟偰乗乿丆 桪廏敪昞徿丆SCOPE仐偮偔偽乗枹棃傪扴偆庒庤尋媶幰偺廤偄2011乗丆 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛乽寁嶼偲嵟揔壔偺怴揥奐乿尋媶晹夛丆2011擭5寧丏
• 壀揷壚栫丆乽尰幚揑側惂栺傪峫椂偟偨桪摍楍幵掆幵墂偺寛掕乿丆 搶嫗擾岺戝妛岺妛晹忣曬岺妛壢懖嬈榑暥丆 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛 戞29夞妛惗榑暥徿丆 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛丆 2011擭9寧丏
• 拞嶳棔丆暯惉24擭搙僨乕僞夝愅僐儞儁僥傿僔儑儞 壽戣愝掕晹栧丆擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛 擔杮僨乕僞儀乕僗妛夛 崌摨嵟廔敪昞夛丆姼摤徿丆2013擭2寧丏 乮僠乕儉乽偺偆偙偆偍傉偲[儊儞僶乕丗拞嶳棔丆媨戙棽暯]乿偲偟偰庴徿丟 嵟廔僗僐傾3埵乛嶲壛32僠乕儉乯丏
• 崱堜抭戝丆乽恔嵭帪偺搆曕婣戭幰傪懳徾偲偟偨壖愝僩僀儗偺嵟揔攝抲偵娭偡傞尋媶乿丆 桪廏敪昞徿丆嵟揔壔偺棟榑偲墳梡乗枹棃傪扴偆庒庤尋媶幰偺廤偄2013乗丆 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛乽嵟揔壔偺棟榑偲墳梡乿尋媶晹夛丆2013擭6寧丏
• 拞嶳棔丆乽峲嬻婡偵偍偗傞忔媞搵忔愴棯偺嵟揔壔乿丆 妛惗桪廏敪昞徿丆擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛 2015擭弔婫尋媶敪昞夛丆 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛丆2015擭3寧丏
• 揷拞婱戝丆乽憤摉傝儕乕僌愴偵偍偗傞岞暯側儂乕儉傾僂僃僀妱傝摉偰偺峔抸乿丆 桪廏敪昞徿丆嵟揔壔偺婎斦偲僼儘儞僥傿傾乗枹棃傪扴偆庒庤尋媶幰偺廤偄2015乗丆 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛乽嵟揔壔偺婎斦偲僼儘儞僥傿傾乿尋媶晹夛丆2015擭7寧丏
• 嵅摗旤桽丆 嵟桪廏億僗僞乕徿丆2015擭搙搶嫗擾岺戝妛岺妛晹丒岺妛晎妛惗偵傛傞尋媶敪昞夛丆 搶嫗擾岺戝妛丆2016擭1寧丏
• 壓揷抭榓丆乽搶嫗搒怱偵偍偗傞崅懍儅儔僜儞僐乕僗偺愝掕乿丆 桪廏敪昞徿丆嵟揔壔偺婎斦偲僼儘儞僥傿傾乗枹棃傪扴偆庒庤尋媶幰偺廤偄2016乗丆 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛乽嵟揔壔偺婎斦偲僼儘儞僥傿傾乿尋媶晹夛丆2016擭5寧丏
• 恄扟弐夘丆乽崿崌惍悢擇師悕寁夋朄偵傛傞AIC嵟彫壔庤朄偺崅懍壔乿丆 桪廏敪昞徿丆嵟揔壔偺婎斦偲僼儘儞僥傿傾乗枹棃傪扴偆庒庤尋媶幰偺廤偄2017乗丆 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛乽嵟揔壔偺婎斦偲僼儘儞僥傿傾乿尋媶晹夛丆2017擭5寧丏
• 揷懞棽懢丆乽懡廳嫟慄惈傪峫椂偟偨曄悢慖戰庤朄偺採埬乿丆 搶嫗擾岺戝妛戝妛堾岺妛晎忣曬岺妛愱峌廋巑榑暥丆 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛 戞35夞妛惗榑暥徿丆 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛丆 2017擭9寧丏
• 恄扟弐夘丆乽懡崁儘僕僢僩儌僨儖偺曄悢慖戰栤戣偵懳偡傞惍悢嵟揔壔庤朄偺峔抸乿丆 搶嫗擾岺戝妛戝妛堾岺妛晎忣曬岺妛愱峌廋巑榑暥丆 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛 戞37夞妛惗榑暥徿丆 擔杮僆儁儗乕僔儑儞僘丒儕僒乕僠妛夛丆 2019擭9寧丏

婰榐側偳

• 2004擭5寧乣6寧偵NHK偺塹惎曻憲偱42擔娫偵傢偨傝曻塮偝傟偨丆乽楍搰廲抐 揝摴12000km偺椃乿偲偄偆斣慻偺儖乕僩嶌惉傪 妺惣偔傫 偲峴偄傑偟偨丏
• 惍悢寁夋栤戣偺儀儞僠儅乕僋廤 MIPLIB 2003 偺 glass4 偲 roll3000 傪夝偒傑偟偨丏乮2006擭7寧乯
• Traveling Tournament Problem 偺僀儞僗僞儞僗 CON16, CON18, CON20, CON22, CON24 偵偮偄偰壓奅傪峏怴偟丆傑偨 CON22 偵娭偟偰偼嵟揔夝傪媮傔傑偟偨丏乮2006擭8寧丗摗尨怢桭丆崱杧怲帯丆徏堜抦屓偲偺嫟摨尋媶乯
• 儕僋儖乕僩幮偑敪峴偡傞廡姧帍R25乮No. 187, 2008擭4寧10擔崋乯偵丆僗億乕僣僗働僕儏乕儕儞僌偵娭偡傞僐儊儞僩偑宖嵹偝傟傑偟偨丏
• 惍悢寁夋栤戣偺儀儞僠儅乕僋廤 MIPLIB 2010 偵丆搳峞偟偨僀儞僗僞儞僗 go19 偑嵦榐偝傟傑偟偨丏乮2011擭5寧乯