3 citations · 4 across the 4 of their papers we have counts for
4 papers
Gaussian Process Classification Bandits
Tatsuya Hayashi, Naoki Ito, Koji Tabata +4
Classification bandits are multi-armed bandit problems whose task is to classify a given set of arms into either positive or negative class depending on whether the rate of the arm…
Solving Challenging Large Scale QAPs
Koichi Fujii, Naoki Ito, Sunyoung Kim +3
We report our progress on the project for solving larger scale quadratic assignment problems (QAPs). Our main approach to solve large scale NP-hard combinatorial optimization probl…
BBCPOP: A Sparse Doubly Nonnegative Relaxation of Polynomial Optimization Problems with Binary, Box and Complementarity Constraints
Naoki Ito, Sunyoung Kim, Masakazu Kojima +2
The software package BBCPOP is a MATLAB implementation of a hierarchy of sparse doubly nonnegative (DNN) relaxations of a class of polynomial optimization (minimization) problems (…
A New Dynamic Pricing Model based on Convex Hull Pricing
Naoki Ito, Akiko Takeda, Toru Namerikawa
This paper presents a new dynamic pricing model (a.k.a. real-time pricing) that reflects startup costs of generators. Dynamic pricing, which is a method to control demand by pricin…