3 citations · 3 across the 1 of their papers we have counts for
2 papers
math.OC2021★ 3 cited
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…
math.OC2018
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 (…