activity
20112026
most citedA 2.75-Approximation Algorithm for the Unconstrained Traveling Tournament Problem

14 citations · 18 across the 5 of their papers we have counts for

collaborators

5 papers

math.OC2026

Cross-validation-based optimal feature selection for linear SVM classification

Masaharu Mori, Shunnosuke Ikeda, Ryuta Tamura +2

This paper addresses feature subset selection for Support Vector Machines (SVMs) based on the cross-validation criterion. Unlike statistical criteria such as the Akaike information…

cs.LG2022★ 2 cited

Feature subset selection for kernel SVM classification via mixed-integer optimization

Ryuta Tamura, Yuichi Takano, Ryuhei Miyashiro

We study the mixed-integer optimization (MIO) approach to feature subset selection in nonlinear kernel support vector machines (SVMs) for binary classification. First proposed for…

cs.DM2021★ 1 cited

Characterization of canonical systems with six types of coins for the change-making problem

Yuma Suzuki, Ryuhei Miyashiro

This paper analyzes a necessary and sufficient condition for the change-making problem to be solvable with a greedy algorithm. The change-making problem is to minimize the number o…

stat.ME2015★ 1 cited

Piecewise-Linear Approximation for Feature Subset Selection in a Sequential Logit Model

Toshiki Sato, Yuichi Takano, Ryuhei Miyashiro

This paper concerns a method of selecting a subset of features for a sequential logit model. Tanaka and Nakagawa (2014) proposed a mixed integer quadratic optimization formulation…

cs.DS2011★ 14 cited

A 2.75-Approximation Algorithm for the Unconstrained Traveling Tournament Problem

Shinji Imahori, Tomomi Matsui, Ryuhei Miyashiro

A 2.75-approximation algorithm is proposed for the unconstrained traveling tournament problem, which is a variant of the traveling tournament problem. For the unconstrained traveli…