I obtained my PhD cum laude at the Discrete Mathematics and Mathematical Programming (DMMP) group, University of Twente, in 2025. Before that, I obtained an MSc degree in applied physics in the Computational Chemical Physics group, also at the University of Twente. My main interests are (discrete) mathematical optimization, combinatorics, and the probabilistic analysis of algorithms.
Expertise
Mathematics
- Traveling Salesperson Problem
- Opts _ _ _
- Local Search
- Bounds
- Polynomial
- Clustering
- Worst Case
Computer Science
- Search Heuristic
Organisations
Publications
2025
Performance of efficient variants of the 2-Opt heuristic for the traveling salesperson problem (2025)Discrete applied mathematics, 375, 7-16. Manthey, B. & van Rhijn, J.https://doi.org/10.1016/j.dam.2025.05.034Non-periodic Fourier propagation algorithms for partial differential equations (2025)[Working paper › Preprint]. ArXiv.org. Hatharasinghe, C., Teh, R. Y., van Rhijn, J., Drummond, P. D. & Reid, M. D.https://doi.org/10.48550/arXiv.2507.21757Improved Smoothed Analysis of 2-Opt for the Euclidean TSP (2025)Algorithmica, 87(7), 1008-1039. Manthey, B. & van Rhijn, J.https://doi.org/10.1007/s00453-025-01309-9Convergence and Running Time of Time-dependent Ant Colony Algorithms (2025)[Working paper › Preprint]. ArXiv.org. Manthey, B., van Rhijn, J., Safari, A. & Vredeveld, T.https://doi.org/10.48550/arXiv.2501.10810Rigorous analysis of local search heuristics (2025)[Thesis › PhD Thesis - Research UT, graduation UT]. University of Twente. van Rhijn, J.https://doi.org/10.3990/1.9789036563277
2024
Complexity of Local Search for Euclidean Clustering Problems (2024)In 35th International Symposium on Algorithms and Computation, ISAAC 2024 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 322). Dagstuhl. Manthey, B., Morawietz, N., van Rhijn, J. & Sommer, F.https://doi.org/10.4230/LIPIcs.ISAAC.2024.48Counting Locally Optimal Tours in the TSP (2024)[Working paper › Preprint]. ArXiv.org. Manthey, B. & van Rhijn, J.https://doi.org/10.48550/arXiv.2410.18650Worst-Case and Smoothed Analysis of the Hartigan-Wong Method for k-Means Clustering (2024)In 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024. Article 52 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 289). Dagstuhl. Manthey, B. & van Rhijn, J.https://doi.org/10.4230/LIPIcs.STACS.2024.52
2023
Approximation Ineffectiveness of a Tour-Untangling Heuristic (2023)In Approximation and Online Algorithms - 21st International Workshop, WAOA 2023, Proceedings (pp. 1-13) (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 14297 LNCS). Springer. Manthey, B. & van Rhijn, J.https://doi.org/10.1007/978-3-031-49815-2_1Complexity of Local Search for Euclidean Clustering Problems (2023)[Working paper › Preprint]. ArXiv.org. Manthey, B., Morawietz, N., van Rhijn, J. & Sommer, F.https://doi.org/10.48550/arXiv.2312.14916
Research profiles
Address
University of Twente
Zilverling (building no. 11), room 4029
Hallenweg 19
7522 NH Enschede
Netherlands
University of Twente
Zilverling 4029
P.O. Box 217
7500 AE Enschede
Netherlands
Scan the QR code or