3 citations · 6 across the 4 of their papers we have counts for
4 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…
Faster exact solution of sparse MaxCut and QUBO problems
Daniel Rehfeldt, Thorsten Koch, Yuji Shinano
The maximum-cut problem is one of the fundamental problems in combinatorial optimization. With the advent of quantum computers, both the maximum-cut and the equivalent quadratic un…
Assessing the Effectiveness of (Parallel) Branch-and-bound Algorithms
Stephen J. Maher, Ted K. Ralphs, Yuji Shinano
Empirical studies are fundamental in assessing the effectiveness of implementations of branch-and-bound algorithms. The complexity of such implementations makes empirical study dif…
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…