Dr. Matthias Walter  Alumni

Büro:
B243
Telefon:
+49 241 80 93390
Email:
Sprechstunde:
nach Vereinbarung / by appointment

Andere Profile im Web:

Publikationen

Ermel, D. and Walter, M.
Parity polytopes and binarization. Discrete Applied Mathematics, April 2018.
Walter, M.
Investigating Polyhedra by Oracles and Analyzing Simple Extensions of Polytopes. Dissertation, Otto-von-Guericke-Universität, April 2016.
Walter, M., Dey, S., Damci-Kurt, P. and Kücükyavuz, S.
On a cardinality-constrained transportation problem with market choice. Operations Research Letters, 44(2):170—173, March 2016.
Walter, M., Lee, J., Kaibel, V. and Weltge, S.
Extended Formulations for Independence Polytopes of Regular Matroids. Graphs and Combinatorics, 32(5):1931—1944, January 2016.
Kaibel, V. and Walter, M.
Simple extensions of polytopes. Mathematical Programming, Series B, 154(1—2):381—406, January 2015.
Conforti, M., Kaibel, V., Walter, M. and Weltge, S.
Subgraph polytopes and independence polytopes of count matroids. Operations Research Letters, 43(5):457—460, January 2015.
Kaibel, V. and Walter, M.
Simple Extensions of Polytopes. In Lee, J. and Vygen, J., Integer Programming and Combinatorial Optimization (IPCO), pages 309—320, January 2014. Springer. Lecture Notes in Computer Science, vol 8494.
Walter, M. and Truemper, K.
Implementation of a unimodularity test. Mathematical Programming Computation, 5(1):57—73, January 2013.
Walter, M.
Sparsity of Lift-and-Project Cutting Planes. In Helber, S., Breitner, M., Rösch, D., Graf von der Schulenburg, J., Schön, C., Sibbertsen, P., Steinbach, M., Weber, S. and Wolter, A., Operations Research Proceedings 2012. pages 9—14, Springer International Publishing, Hannover, January 2012.

Vorträge

23rd Combinatorial Optimization Workshop, Aussois, Frankreich, January 9, 2019.
Eingeladen: Computing Implicit Equations and the Tight-Cut Decomposition of a Hypergraph von M. Walter
Combinatorial Optimization Workshop, Aussois, Frankreich, January 8, 2019.
Eingeladen: Extended Formulations for Radial Cones of Odd-Cut Polyhedra von M. Walter
Forschungsinstitut für Diskrete Mathematik, Bonn, Deutschland, December 3, 2018.
Eingeladen: Extended Formulations for Radial Cones von M. Walter
Colloquium on Combinatorics, Paderborn, Deutschland, November 24, 2018.
Eingeladen: Extended Formulations for Radial Cones von M. Walter
Institut für Mathematische Optimierung, Otto-von-Guericke Universität, Magdeburg, Deutschland, November 2, 2018.
Eingeladen: Extended Formulations for Radial Cones von M. Walter
SCIP Workshop, Aachen, Deutschland, March 8, 2018.
Eingeladen: Solving Bulk-Robust Assignment Problems to Optimality von M. Walter
Combinatorial Optimization Workshop, Aussois, Frankreich, January 9, 2018.
Eingeladen: Solving Bulk-Robust Assignment Problems to Optimality von M. Walter
OR 2017, Berlin, Deutschland, September 7, 2017.
Vortrag: Parity Polytopes and Binarization von M. Walter
ETH Zürich / IFOR, Zürich, Schweiz, August 18, 2017.
Eingeladen: Solving Bulk-Robust Assignment Problems to Optimality von M. Walter
OVGU / IMO, Magdeburg, Deutschland, August 10, 2017.
Eingeladen: Solving Bulk-Robust Assignment Problems to Optimality von M. Walter
CTW 2017, Köln, Deutschland, June 8, 2017.
Teilnahme von M. Walter
IPCO XVI Poster, Bonn, Deutschland,
Eingeladen: Computational Study of Graphic TSP Approximation Algorithms von M. Walter

RepORts

Gleixner, A.M., Bastubbe, M., Eifler, L., Gally, T., Gamrath, G., Gottwald, R.L., Hendel, G., Hojny, C., Koch, T., Lübbecke, M., Maher, S.J., Miltenberger, M., Müller, B., Pfetsch, M.E., Puchert, C., Rehfeldt, D., Schlösser, F., Schubert, C., Serrano, F., Shinano, Y., Viernickel, J.M., Walter, M., Wegscheider, F., Witt, J.T. and Witzig, J.
The SCIP Optimization Suite 6.0. repORt 2018—049, July 2018.
Walter, M. and Weltge, S.
Extended Formulations for Radial Cones. repORt 2018—046, May 2018. Submitted.
Punnen, A.P. and Walter, M.
A characterization of linearizable instances of the Quadratic Traveling Salesman Problem. repORt 2018—045, May 2018. Submitted.
Walter, M.
Complete Description of Matching Polytopes with One Linearized Quadratic Term for Bipartite Graphs. repORt 2016—08—01, August 2016.