Heuristics for the data arrangement problem on regular trees. - Eranda Çela; Rostislav Stanek (J. Comb. Optim., 2015)

Linear Models and Computational Experiments for the Quadratic TSP. - Anja Fischer; J. Fabian Meier; Ulrich Pferschy; Rostislav Stanek (Electron. Notes Discret. Math., 2016)

Generating subtour elimination constraints for the TSP from pure integer solutions. - Ulrich Pferschy; Rostislav Stanek (Central Eur. J. Oper. Res., 2017)

Geometric and LP-based heuristics for the quadratic travelling salesman problem. - Rostislav Stanek; Peter Greistorfer; Klaus Ladner; Ulrich Pferschy (CoRR, 2018)

Geometric and LP-based heuristics for angular travelling salesman problems in the plane. - Rostislav Stanek; Peter Greistorfer; Klaus Ladner; Ulrich Pferschy (Comput. Oper. Res., 2019)

Zur Wahlkompetenz von Studierenden. - Gerhard Reichmann; Klaus Ladner; Rostislav Stanek (Inf. Wiss. Prax., 2021)

A Tabu Search Matheuristic for the Generalized Quadratic Assignment Problem. - Peter Greistorfer; Rostislav Stanek; Vittorio Maniezzo (MIC, 2022)

Advanced optimization models for the location of charging stations in e-mobility. - Rostislav Stanek; Peter Greistorfer; Anna Elisabeth Kastner (Central Eur. J. Oper. Res., 2024)