Over mij
Ik promoveerde aan de Otto-von-Guericke Universiteit van Maagdenburg. Ik werk aan oplossende technieken voor mixed-integer programma's (MIP's) aan de praktische kant (vertakkingen en sneden, vertakkingen en prijzen) en
polyhedral combinatorics aan de theoretische kant.
Expertises
Mathematics
# Cutting Planes
# Extended Formulations
# Formulation
# Linear Programming
# Linear Programming Relaxation
# Odd Cycle
# Polytope
# Stable Set
Verbonden aan
Publicaties
Recent
Zou, R., Lin, B.
, Uetz, M.
, & Walter, M. (2023).
Algorithmic Solutions for Maximizing Shareable Costs. ArXiv.org.
https://doi.org/10.48550/arXiv.2303.00052
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.
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, [100741].
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.org.
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
Pure Link
Verbonden aan Opleidingen
Master
Vakken Collegejaar 2022/2023
Vakken in het huidig collegejaar worden toegevoegd op het moment dat zij definitief zijn in het Osiris systeem. Daarom kan het zijn dat de lijst nog niet compleet is voor het gehele collegejaar.
Vakken Collegejaar 2021/2022
Current Projects
Contactgegevens
Bezoekadres
Universiteit Twente
Faculty of Electrical Engineering, Mathematics and Computer Science
Zilverling
(gebouwnr. 11), kamer 4005
Hallenweg 19
7522NH Enschede
Postadres
Universiteit Twente
Faculty of Electrical Engineering, Mathematics and Computer Science
Zilverling
4005
Postbus 217
7500 AE Enschede