Characterizing Feasible Pattern Sets with a Minimum Number of Breaks. - Ryuhei Miyashiro; Hideya Iwasaki; Tomomi Matsui (PATAT, 2002)

Notes on Equitable Round-Robin Tournaments. - Ryuhei Miyashiro; Tomomi Matsui (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2002)

Semidefinite Programming Based Approaches to Home-Away Assignment Problems in Sports Scheduling. - Ayami Suzuka; Ryuhei Miyashiro; Akiko Yoshise; Tomomi Matsui (AAIM, 2005)

An Algorithm of Feeder Arrangements and Pickup Sequencing of Component Placement Machine on Printed Circuit Board. - Tsuyoshi Yamada; Ryuhei Miyashiro; Mario Nakamori (PDPTA, 2005)

A polynomial-time algorithm to find an equitable home-away assignment. - Ryuhei Miyashiro; Tomomi Matsui (Oper. Res. Lett., 2005)

Constructive Algorithms for the Constant Distance Traveling Tournament Problem. - Nobutomo Fujiwara; Shinji Imahori; Tomomi Matsui; Ryuhei Miyashiro (PATAT, 2006)

Semidefinite programming based approaches to the break minimization problem. - Ryuhei Miyashiro; Tomomi Matsui (Comput. Oper. Res., 2006)

Dependent Randomized Rounding to the Home-Away Assignment Problem in Sports Scheduling. - Ayami Suzuka; Ryuhei Miyashiro; Akiko Yoshise; Tomomi Matsui (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006)

A Tabu Search Algorithm for the Traveling Tournament Problem. - Hirotake Sumikawa; Ryuhei Miyashiro; Mario Nakamori (PDPTA, 2007)

An Improved Approximation Algorithm for the Traveling Tournament Problem. - Daisuke Yamaguchi; Shinji Imahori; Ryuhei Miyashiro; Tomomi Matsui (Algorithmica, 2011)

An approximation algorithm for the traveling tournament problem. - Ryuhei Miyashiro; Tomomi Matsui; Shinji Imahori (Ann. Oper. Res., 2012)

A 2.75-approximation algorithm for the unconstrained traveling tournament problem. - Shinji Imahori; Tomomi Matsui; Ryuhei Miyashiro (Ann. Oper. Res., 2014)

Piecewise-Linear Approximation for Feature Subset Selection in a Sequential Logit Model. - Toshiki Sato; Yuichi Takano; Ryuhei Miyashiro (CoRR, 2015)

Mixed integer second-order cone programming formulations for variable selection in linear regression. - Ryuhei Miyashiro; Yuichi Takano (Eur. J. Oper. Res., 2015)

Subset selection by Mallows' Cp: A mixed integer programming approach. - Ryuhei Miyashiro; Yuichi Takano (Expert Syst. Appl., 2015)

Feature subset selection for logistic regression via mixed integer optimization. - Toshiki Sato; Yuichi Takano; Ryuhei Miyashiro; Akiko Yoshise (Comput. Optim. Appl., 2016)

Feature subset selection for the multinomial logit model via mixed-integer optimization. - Shunsuke Kamiya; Ryuhei Miyashiro; Yuichi Takano (AISTATS, 2019)

Feature Subset Selection for Ordered Logit Model via Tangent-Plane-Based Approximation. - Mizuho Naganuma; Yuichi Takano; Ryuhei Miyashiro (IEICE Trans. Inf. Syst., 2019)

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 (J. Glob. Optim., 2019)

Steepest-edge rule and its number of simplex iterations for a nondegenerate LP. - Masaya Tano; Ryuhei Miyashiro; Tomonari Kitahara (Oper. Res. Lett., 2019)

Feature subset selection for kernel SVM classification via mixed-integer optimization. - Ryuta Tamura; Yuichi Takano; Ryuhei Miyashiro (CoRR, 2022)

Characterization of canonical systems with six types of coins for the change-making problem. - Yuma Suzuki; Ryuhei Miyashiro (Theor. Comput. Sci., 2023)

Branch-and-bound algorithm for optimal sparse canonical correlation analysis. - Akihisa Watanabe; Ryuta Tamura; Yuichi Takano; Ryuhei Miyashiro (Expert Syst. Appl., 2023)

Mixed-Integer Linear Optimization Formulations for Feature Subset Selection in Kernel SVM Classification. - Ryuta Tamura; Yuichi Takano; Ryuhei Miyashiro (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2024)