Welcome...

dr. M. Walter (Matthias)

Assistant Professor

About Me

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.

Expertise

Mathematics
Cutting Planes
Extended Formulations
Formulation
Linear Programming
Linear Programming Relaxation
Matroid
Polytope
Stable Set

Publications

Recent
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). 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 (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 12707 LNCS). 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
RodrĂ­guez-Heck, E., Stickler, K. , Walter, M., & Weltge, S. (2020). Persistency of Linear Programming Relaxations for the Stable Set Problem. In D. Bienstock, & G. Zambelli (Eds.), Integer Programming and Combinatorial Optimization - 21st International Conference, IPCO 2020, Proceedings (pp. 351-363). (Lecture Notes in Computer Science; Vol. 12125). Springer. https://doi.org/10.1007/978-3-030-45771-6_27
Ermel, D. , & Walter, M. (2020). Parity polytopes and binarization. Discrete applied mathematics, 272, 24-30. https://doi.org/10.1016/j.dam.2018.04.008

UT Research Information System

Contact Details

Visiting Address

University of Twente
Faculty of Electrical Engineering, Mathematics and Computer Science
Zilverling (building no. 11), room 4005
Hallenweg 19
7522NH  Enschede
The Netherlands

Navigate to location

Mailing Address

University of Twente
Faculty of Electrical Engineering, Mathematics and Computer Science
Zilverling  4005
P.O. Box 217
7500 AE Enschede
The Netherlands