default search action
Ryuhei Miyashiro
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j16]Ryuta Tamura, Yuichi Takano, Ryuhei Miyashiro:
Mixed-Integer Linear Optimization Formulations for Feature Subset Selection in Kernel SVM Classification. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 107(8): 1151-1162 (2024) - 2023
- [j15]Akihisa Watanabe, Ryuta Tamura, Yuichi Takano, Ryuhei Miyashiro:
Branch-and-bound algorithm for optimal sparse canonical correlation analysis. Expert Syst. Appl. 217: 119530 (2023) - [j14]Yuma Suzuki, Ryuhei Miyashiro:
Characterization of canonical systems with six types of coins for the change-making problem. Theor. Comput. Sci. 955: 113822 (2023) - 2022
- [i4]Ryuta Tamura, Yuichi Takano, Ryuhei Miyashiro:
Feature subset selection for kernel SVM classification via mixed-integer optimization. CoRR abs/2205.14325 (2022) - 2021
- [i3]Yuma Suzuki, Ryuhei Miyashiro:
Characterization of canonical systems with six types of coins for the change-making problem. CoRR abs/2111.12392 (2021)
2010 – 2019
- 2019
- [j13]Mizuho Naganuma, Yuichi Takano, Ryuhei Miyashiro:
Feature Subset Selection for Ordered Logit Model via Tangent-Plane-Based Approximation. IEICE Trans. Inf. Syst. 102-D(5): 1046-1053 (2019) - [j12]Ryuta Tamura, Ken Kobayashi, Yuichi Takano, Ryuhei Miyashiro, Kazuhide Nakata, Tomomi Matsui:
Mixed integer quadratic optimization formulations for eliminating multicollinearity based on variance inflation factor. J. Glob. Optim. 73(2): 431-446 (2019) - [j11]Masaya Tano, Ryuhei Miyashiro, Tomonari Kitahara:
Steepest-edge rule and its number of simplex iterations for a nondegenerate LP. Oper. Res. Lett. 47(3): 151-156 (2019) - [c7]Shunsuke Kamiya, Ryuhei Miyashiro, Yuichi Takano:
Feature subset selection for the multinomial logit model via mixed-integer optimization. AISTATS 2019: 1254-1263 - 2016
- [j10]Toshiki Sato, Yuichi Takano, Ryuhei Miyashiro, Akiko Yoshise:
Feature subset selection for logistic regression via mixed integer optimization. Comput. Optim. Appl. 64(3): 865-880 (2016) - 2015
- [j9]Ryuhei Miyashiro, Yuichi Takano:
Mixed integer second-order cone programming formulations for variable selection in linear regression. Eur. J. Oper. Res. 247(3): 721-731 (2015) - [j8]Ryuhei Miyashiro, Yuichi Takano:
Subset selection by Mallows' Cp: A mixed integer programming approach. Expert Syst. Appl. 42(1): 325-331 (2015) - [i2]Toshiki Sato, Yuichi Takano, Ryuhei Miyashiro:
Piecewise-Linear Approximation for Feature Subset Selection in a Sequential Logit Model. CoRR abs/1510.05417 (2015) - 2014
- [j7]Shinji Imahori, Tomomi Matsui, Ryuhei Miyashiro:
A 2.75-approximation algorithm for the unconstrained traveling tournament problem. Ann. Oper. Res. 218(1): 237-247 (2014) - 2012
- [j6]Ryuhei Miyashiro, Tomomi Matsui, Shinji Imahori:
An approximation algorithm for the traveling tournament problem. Ann. Oper. Res. 194(1): 317-324 (2012) - 2011
- [j5]Daisuke Yamaguchi, Shinji Imahori, Ryuhei Miyashiro, Tomomi Matsui:
An Improved Approximation Algorithm for the Traveling Tournament Problem. Algorithmica 61(4): 1077-1091 (2011) - [i1]Shinji Imahori, Tomomi Matsui, Ryuhei Miyashiro:
A 2.75-Approximation Algorithm for the Unconstrained Traveling Tournament Problem. CoRR abs/1110.0620 (2011)
2000 – 2009
- 2009
- [c6]Daisuke Yamaguchi, Shinji Imahori, Ryuhei Miyashiro, Tomomi Matsui:
An Improved Approximation Algorithm for the Traveling Tournament Problem. ISAAC 2009: 679-688 - 2007
- [c5]Hirotake Sumikawa, Ryuhei Miyashiro, Mario Nakamori:
A Tabu Search Algorithm for the Traveling Tournament Problem. PDPTA 2007: 726-731 - 2006
- [j4]Ryuhei Miyashiro, Tomomi Matsui:
Semidefinite programming based approaches to the break minimization problem. Comput. Oper. Res. 33: 1975-1982 (2006) - [j3]Ayami Suzuka, Ryuhei Miyashiro, Akiko Yoshise, Tomomi Matsui:
Dependent Randomized Rounding to the Home-Away Assignment Problem in Sports Scheduling. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(5): 1407-1416 (2006) - [c4]Nobutomo Fujiwara, Shinji Imahori, Tomomi Matsui, Ryuhei Miyashiro:
Constructive Algorithms for the Constant Distance Traveling Tournament Problem. PATAT 2006: 135-146 - 2005
- [j2]Ryuhei Miyashiro, Tomomi Matsui:
A polynomial-time algorithm to find an equitable home-away assignment. Oper. Res. Lett. 33(3): 235-241 (2005) - [c3]Ayami Suzuka, Ryuhei Miyashiro, Akiko Yoshise, Tomomi Matsui:
Semidefinite Programming Based Approaches to Home-Away Assignment Problems in Sports Scheduling. AAIM 2005: 95-103 - [c2]Tsuyoshi Yamada, Ryuhei Miyashiro, Mario Nakamori:
An Algorithm of Feeder Arrangements and Pickup Sequencing of Component Placement Machine on Printed Circuit Board. PDPTA 2005: 403-409 - 2002
- [j1]Ryuhei Miyashiro, Tomomi Matsui:
Notes on Equitable Round-Robin Tournaments. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 85-A(5): 1006-1010 (2002) - [c1]Ryuhei Miyashiro, Hideya Iwasaki, Tomomi Matsui:
Characterizing Feasible Pattern Sets with a Minimum Number of Breaks. PATAT 2002: 78-99
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 18:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint