dr. M. Walter (Matthias)

Assistant Professor
EEMCS-AM-MOR
Zilverling 4005
m.walter@utwente.nl
+31534898744
Business card

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

  • Computer Science

    • Algorithms
    • System Analysis
    • Linear Programming
    • Integer Programming
    • Classes
    • Complexity

  • Mathematics

    • Polytope
    • Cycles

Organisations

Publications

2024
Optimal subgraphs in geometric scale-free random graphs. ArXiv.org. Michielan, R., Stegehuis, C. & Walter, M.https://doi.org/10.48550/arXiv.2404.14972Relaxation Strength for Multilinear Optimization: McCormick Strikes BackIn Integer Programming and Combinatorial Optimization. Proceedings of 25th IPCO (pp. 393-404). Schutte, E. & Walter, M.https://doi.org/10.1007/978-3-031-59835-7_29
2023
Relaxation strength for multilinear optimization: McCormick strikes back. ArXiv.org. Schutte, E. & Walter, M.https://doi.org/10.48550/arXiv.2311.08570Recognizing Series-Parallel Matrices in Linear Time, 1404-1418. Walter, M.https://doi.org/10.1287/ijoc.2021.0233Simple odd β -cycle inequalities for binary polynomial optimization. Pia, A. D. & Walter, M.https://doi.org/10.1007/s10107-023-01992-yOptimizing Parcel Transportation of PostNL. European Consortium for Mathematics in Industry (ECMI). Hoeksma, R., Hojny, C., van Ommeren, J. C. W. & Walter, M.https://doi.org/10.33774/miir-2023-7dh5pAlgorithmic Solutions for Maximizing Shareable Costs. ArXiv.org. Zou, R., Lin, B., Uetz, M. & Walter, M.https://doi.org/10.48550/arXiv.2303.00052The Binary Linearization Complexity of Pseudo-Boolean Functions. Walter, M.
2022
A polyhedral study for the cubic formulation of the unconstrained traveling tournament problem, Article 100741. Siemann, M. R. & Walter, M.https://doi.org/10.1016/j.disopt.2022.100741Simple Odd β -Cycle Inequalities for Binary Polynomial OptimizationIn Integer Programming and Combinatorial Optimization. IPCO 2022: 23rd International Conference, IPCO 2022, Eindhoven, The Netherlands, June 27–29, 2022, Proceedings (pp. 181–194). Springer. Del Pia, A. & Walter, M.https://doi.org/10.1007/978-3-031-06901-7_14

Research profiles

Current projects

Combinatorial Matrix Recognition

Software Library

A set of tools for recognizing certain combinatorial matrices, such as totally unimodular, balanced, network or series-parallel matrices.

Investigating Polyhedra by Oracles

Software Library

Investigating Polyhedra by Oracles (IPO) is a C++ library that enables the analysis of polyhedra that are given implicitly by means of an optimization oracle. The main application is the search for inequalities that are facet-defining for the mixed-integer hull of some mixed-integer optimization problem.

Making Mixed-Integer Programming Solvers Smarter and Faster using Network Matrices

Mixed-integer optimization is a technique to solve complex optimization problems which arise in production planning, logistics and routing. This research will improve the solver software to make it faster. To achieve this, algorithms to find well-known patterns in a given formulation will be developed and tested.

Address

University of Twente

Zilverling (building no. 11), room 4005
Hallenweg 19
7522 NH Enschede
Netherlands

Navigate to location

Organisations

Scan the QR code or
Download vCard