I obtained my PhD at Otto-von-Guericke University Magdeburg. I work on solving techniques for mixed-integer programs (MIPs) on the practical side (branch-and-cut, branch-and-price) as well as polyhedral combinatorics on the theoretical side.
# Cutting Planes # Extended Formulations # Formulation # Linear Programming # Linear Programming Relaxation # Odd Cycle # Polytope # Stable Set
van den Bosse, J. , Uetz, M. , & Walter, M. (2022). Exact Price of Anarchy for Weighted Congestion Games with Two Players. In I. Ljubić, F. Barahona, S. S. Dey, & A. R. Mahjoub (Eds.), Combinatorial Optimization: 7th International Symposium, ISCO 2022, Virtual Event, May 18–20, 2022, Revised Selected Papers (pp. 159-171). (Lecture Notes in Computer Science; Vol. 13526). Springer Science + Business Media. https://doi.org/10.1007/978-3-031-18530-4_12
Siemann, M. R. , & Walter, M. (2022). A polyhedral study for the cubic formulation of the unconstrained traveling tournament problem. Discrete optimization, 46, . https://doi.org/10.1016/j.disopt.2022.100741
Del Pia, A. , & Walter, M. (2022). Simple Odd β -Cycle Inequalities for Binary Polynomial Optimization. In K. Aardal, & L. Sanità (Eds.), Integer Programming and Combinatorial Optimization. IPCO 2022: 23rd International Conference, IPCO 2022, Eindhoven, The Netherlands, June 27–29, 2022, Proceedings (pp. 181–194). (Lecture Notes in Computer Science; Vol. 13265). Springer. https://doi.org/10.1007/978-3-031-06901-7_14
Walter, M. (2021). Recognizing Series-Parallel Matrices in Linear Time. ArXiv.
Walter, M. (2021). The Graphical Traveling Salesperson Problem has no integer programming formulation in the original space. Operations research letters, 49(4), 623-624. https://doi.org/10.1016/j.orl.2021.06.015
Walter, M. (2021). Face Dimensions of General-Purpose Cutting Planes for Mixed-Integer Linear Programs. In M. Singh, & D. P. Williamson (Eds.), Integer Programming and Combinatorial Optimization: 22nd International Conference, IPCO 2021, Atlanta, GA, USA, May 19–21, 2021, Proceedings (pp. 399-412). (Lecture Notes in Computer Science; Vol. 12707). Springer. https://doi.org/10.1007/978-3-030-73879-2_28
Rodríguez-Heck, E., Stickler, K. , Walter, M., & Weltge, S. (2021). Persistency of linear programming relaxations for the stable set problem. Mathematical programming. https://doi.org/10.1007/s10107-020-01600-3
Siemann, M. , & Walter, M. (2020). A Polyhedral Study for the Cubic Formulation of the Unconstrained Traveling Tournament Problem. arXiv.org.
UT Research Information System
Affiliated Study Programmes
Courses Academic Year 2022/2023
Courses in the current academic year are added at the moment they are finalised in the Osiris system. Therefore it is possible that the list is not yet complete for the whole academic year.