47 citations · 51 across the 8 of their papers we have counts for
8 papers
An Exceptionally Difficult Binary Quadratic Optimization Problem with Symmetry: a Challenge for The Largest Unsolved QAP Instance Tai256c
Koichi Fujii, Sunyoung Kim, Masakazu Kojima +2
Tai256c is the largest unsolved quadratic assignment problem (QAP) instance in QAPLIB. It is known that QAP tai256c can be converted into a 256 dimensional binary quadratic optimiz…
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…
Random-Sampling Monte-Carlo Tree Search Methods for Cost Approximation in Long-Horizon Optimal Control
Shankarachary Ragi, Hans D. Mittelmann
In this paper, we develop Monte-Carlo based heuristic approaches to approximate the objective function in long horizon optimal control problems. In these approaches, to approximate…
Polynomial-Time Methods to Solve Unimodular Quadratic Programs With Performance Guarantees
Shankarachary Ragi, Edwin K. P. Chong, Hans D. Mittelmann
We develop polynomial-time heuristic methods to solve unimodular quadratic programs (UQPs) approximately, which are known to be NP-hard. In the UQP framework, we maximize a quadrat…
Statistical Analysis of a Posteriori Channel and Noise Distribution Based on HARQ Feedback
Wenhao Wu, Hans Mittelmann, Zhi Ding
In response to a comment on one of our manuscript, this work studies the posterior channel and noise distributions conditioned on the NACKs and ACKs of all previous transmissions i…
A new formulation of protein evolutionary models that account for structural constraints
Andrew J. Bordner, Hans D. Mittelmann
Despite the importance of a thermodynamically stable structure with a conserved fold for protein function, almost all evolutionary models neglect site-site correlations that arise…
Semidefinite code bounds based on quadruple distances
Dion C. Gijswijt, Hans D. Mittelmann, Alexander Schrijver
Let be the maximum number of words of length , any two having Hamming distance at least . We prove , which implies that the quadruply shortened Go…
High accuracy semidefinite programming bounds for kissing numbers
Hans D. Mittelmann, Frank Vallentin
The kissing number in n-dimensional Euclidean space is the maximal number of non-overlapping unit spheres which simultaneously can touch a central unit sphere. Bachoc and Vallentin…