Ryuhei Miyashiro

Orcid: 0000-0003-3828-4013

According to our database1, Ryuhei Miyashiro authored at least 24 papers between 2002 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Mixed-Integer Linear Optimization Formulations for Feature Subset Selection in Kernel SVM Classification.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2024

2023
Branch-and-bound algorithm for optimal sparse canonical correlation analysis.
Expert Syst. Appl., May, 2023

Characterization of canonical systems with six types of coins for the change-making problem.
Theor. Comput. Sci., April, 2023

2022
Feature subset selection for kernel SVM classification via mixed-integer optimization.
CoRR, 2022

2019
Steepest-edge rule and its number of simplex iterations for a nondegenerate LP.
Oper. Res. Lett., 2019

Mixed integer quadratic optimization formulations for eliminating multicollinearity based on variance inflation factor.
J. Glob. Optim., 2019

Feature Subset Selection for Ordered Logit Model via Tangent-Plane-Based Approximation.
IEICE Trans. Inf. Syst., 2019

Feature subset selection for the multinomial logit model via mixed-integer optimization.
Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

2016
Feature subset selection for logistic regression via mixed integer optimization.
Comput. Optim. Appl., 2016

2015
Subset selection by Mallows' C<sub>p</sub>: A mixed integer programming approach.
Expert Syst. Appl., 2015

Mixed integer second-order cone programming formulations for variable selection in linear regression.
Eur. J. Oper. Res., 2015

Piecewise-Linear Approximation for Feature Subset Selection in a Sequential Logit Model.
CoRR, 2015

2014
A 2.75-approximation algorithm for the unconstrained traveling tournament problem.
Ann. Oper. Res., 2014

2012
An approximation algorithm for the traveling tournament problem.
Ann. Oper. Res., 2012

2011
An Improved Approximation Algorithm for the Traveling Tournament Problem.
Algorithmica, 2011

2007
A Tabu Search Algorithm for the Traveling Tournament Problem.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2007

2006
Dependent Randomized Rounding to the Home-Away Assignment Problem in Sports Scheduling.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006

Semidefinite programming based approaches to the break minimization problem.
Comput. Oper. Res., 2006

Constructive Algorithms for the Constant Distance Traveling Tournament Problem.
Proceedings of the Practice and Theory of Automated Timetabling VI, 2006

2005
A polynomial-time algorithm to find an equitable home-away assignment.
Oper. Res. Lett., 2005

An Algorithm of Feeder Arrangements and Pickup Sequencing of Component Placement Machine on Printed Circuit Board.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2005

Semidefinite Programming Based Approaches to Home-Away Assignment Problems in Sports Scheduling.
Proceedings of the Algorithmic Applications in Management, First International Conference, 2005

2002
Notes on Equitable Round-Robin Tournaments.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2002

Characterizing Feasible Pattern Sets with a Minimum Number of Breaks.
Proceedings of the Practice and Theory of Automated Timetabling IV, 2002


  Loading...