3 citations · 6 across the 8 of their papers we have counts for
11 papers
The Largest Unsolved QAP Instance Tai256c Can Be Converted into A 256-dimensional Simple BQOP with A Single Cardinality Constraint
Koichi Fujii, Sunyoung Kim, Masakazu Kojima +2
Tai256c is the largest unsolved quadratic assignment problem (QAP) instance in QAPLIB; a 1.48\% gap remains between the best known feasible objective value and lower bound of the u…
Exact SDP relaxations for quadratic programs with bipartite graph structures
Godai Azuma, Mituhiro Fukuda, Sunyoung Kim +1
For nonconvex quadratically constrained quadratic programs (QCQPs), we first show that, under certain feasibility conditions, the standard semidefinite (SDP) relaxation is exact fo…
Generating Cutting Inequalities Successively for Quadratic Optimization Problems in Binary Variables
Sunyoung Kim, Masakazu Kojima
We propose a successive generation of cutting inequalities for binary quadratic optimization problems. Multiple cutting inequalities are successively generated for the convex hull…
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…
Exact SDP relaxations of quadratically constrained quadratic programs with forest structures
Godai Azuma, Mituhiro Fukuda, Sunyoung Kim +1
We study the exactness of the semidefinite programming (SDP) relaxation of quadratically constrained quadratic programs (QCQPs). With the aggregate sparsity matrix from the data ma…
A Newton-bracketing method for a simple conic optimization problem
Sunyoung Kim, Masakazu Kojima, Kim-Chuan Toh
For the Lagrangian-DNN relaxation of quadratic optimization problems (QOPs), we propose a Newton-bracketing method to improve the performance of the bisection-projection method imp…