Rostislav Staněk |
Travelling salesman problem (TSP)
Quadratic assignment problem (QAP)
Quadratic travelling salesman problem (QTSP)
Angular-metric travelling salesman problem (AngleTSP)
Maximum quadratic travelling salesman problem (MaxQTSP)
Maximum angular-metric travelling salesman problem (AngleTSP)
Data arrangement problem (DAPT)
Open problem: Is the DAPT solvable in polynomial time if both the guest and the host graph are binary regular trees?
For more details see https://angemath.unileoben.ac.at/en/research/operations-research.