dr. M. Walter (Matthias)

Universitair docent
EEMCS-AM-MOR
Zilverling 4005
m.walter@utwente.nl
+31534898744
Visitekaartje

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

  • Computer Science

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

  • Mathematics

    • Polytope
    • Cycles

Organisaties

Publicaties

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

Onderzoeksprofielen

Lopende projecten

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.

Slimmere en snellere mixed-integer optimalisatie via netwerkmatrices

Mixed-integer optimalisatie is een techniek om ingewikkelde optimalisatieproblemen op te lossen die zich voordoen bij productieplanning, logistiek of routeplanning. Dit onderzoek zal de solver- software verbeteren om de software sneller te maken. Om dit te bereiken, zullen algoritmes om bekende patronen in een gegeven formulering te vinden worden ontwikkend en getest.

Adres

Universiteit Twente

Zilverling (gebouwnr. 11), kamer 4005
Hallenweg 19
7522 NH Enschede

Navigeer naar locatie

Organisaties

Scan de QR-code of
Download vCard