Recent Research Accomplishments

Hans Mittelmann, Arizona State University

One part of our research-supporting service effort was recently acknowledged

TSP-Concorde-NEOS

The following new results in combinatorial optimization were obtained

Kissing Numbers: New upper bounds on all kissing numbers up to dimension 23

    Our kissing number bounds from 2009 were listed on Wikipedia, see ref [3] there. By additionally exploiting symmetry some improvements in larger dimensions were obtained in 2016, see ref [12]

Index Assignment: Lower bounds on the QAP from wireless communications up to dimension 512

Binary Codes: New upper bounds for binary codes

    Our bounds are listed here

Q3AP: Solution of previously unsolved 3d QAP from wireless communications

QAPLIB_bounds: Improved lower bounds for unsolved QAPLIB instances

QAPLIB_exact: Work estimates to solve QAPLIB instances exactly

QAPLIB_unsolved: New lower bound for largest unsolved QAPLIB instance