Jonas Witt, M.Sc. 

Office:
B251
Fon:
+49 241 80 93387
Email:
Office hours:
nach Vereinbarung

Forschungsinteressen:

  • Column Generation und Branch-and-Price
  • Cutting Planes in Branch-and-Price
  • Stärke von Dantzig-Wolfe Reformulierungen

Forschungsprojekte:

Lehre:

  • Column Generation und Branch-and-Price (WS2017/18, WS2014/15, WS2013/14)
  • Operations Research 1 (WS2016/17, WS2015/16)
  • Operations Research 2 (SS2015)
  • Quantitative Methoden/Einführung in Operations Research (SS2014, SS2015, SS2016)

Sonstige Projekte:

  • Zuteilung von Studierenden zu teilnehmerbeschränkten Modulen der WiWi-Fakultät mit Hilfe ganzzahliger linearer Programmierung
  • Zuteilung der Klausuraufsichten von Bachelor-Pflicht-Klausuren der WiWi-Fakultät mit Hilfe ganzzahliger linearer Programmierung

 

Andere Profile im Web:

Publications

Witt, J.T., Lübbecke, M. and Reed, B.
Polyhedral results on the stable set problem in graphs containing even or odd pairs. Mathematical Programming, 171(1—2):519—522, August 2018.
Lübbecke, M. and Witt, J.T.
The strength of Dantzig–Wolfe reformulations for the stable set and related problems. Discrete Optimization, 30:168—187, August 2018.
Bastubbe, M., Lübbecke, M. and Witt, J.T.
A Computational Investigation on the Strength of Dantzig-Wolfe Reformulations. In D'Angelo, G., Experimental Algorithms - SEA 2018, pages 11:1—11:12, May 2018. Schloss Dagstuhl-Leibniz-Zentrum für Informatik. Leibniz International Proceedings in Informatics (LIPIcs), vol. 103 (instances available at https://www.or.rwth-aachen.de/files/research/publications/alldecomps_instances.zip).
Bergner, M., Lübbecke, M. and Witt, J.T.
A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs. Journal of Experimental Algorithmics (JEA), 21:1.2:1—1.2:16, December 2015.
Lübbecke, M. and Witt, J.T.
Separation of Generic Cutting Planes in Branch-and-Price Using a Basis. In Bampis, E., Experimental Algorithms - SEA 2015, pages 110—121, May 2015. Springer. Lecture Notes in Computer Science, vol 9125.
Bergner, M., Lübbecke, M. and Witt, J.T.
A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs. In Gudmundsson, J. and Katajainen, J., Experimental Algorithms - SEA 2014, pages 34—45, May 2014. Springer. Lecture Notes in Computer Science, vol 8504.

Talks

participation von J.T. Witt
Symposium on Experimental Algorithms (SEA) 2018, L'Aquila, Italy, June 27 - 29, 2018.
participation von J.T. Witt
participation von J.T. Witt
SCIP Workshop, Aachen, Germany, March 8, 2018.
invite: Eliminating redundant columns from column generation subproblems using classical Benders' cuts von J.T. Witt
Operations Research (OR) 2017, Berlin, Germany, September 06 - 08, 2017.
participation von J.T. Witt
Operations Research (OR) 2016, Hamburg, Germany, August 30 - September 2, 2016.
participation von J.T. Witt
Column Generation 2016, Búzios, Brazil, May 22 - 25, 2016.
invite: Dantzig-Wolfe Reformulations for the Stable Set Problem and Possible Extensions to Related Problems von J.T. Witt
Relaxation Workshop, Bonn, Germany, November 16 - 20, 2015.
participation von J.T. Witt
Operations Research (OR) 2015, Vienna, Austria, September 1 - 4, 2015.
participation von J.T. Witt
22nd International Symposium on Mathematical Programming, Pittsburgh, PA, United States, July 12 - 17, 2015.
participation von J.T. Witt
Symposium on Experimental Algorithms (SEA) 2015, Paris, France, June 29 - July 1, 2015.
participation von J.T. Witt
19th Combinatorial Optimization Workshop, Aussois, France, January 5 - 9, 2015.
participation von J.T. Witt
SCIP Workshop 2014, Berlin, Germany, September 30 - October 2, 2014.
participation von J.T. Witt
Operations Research (OR) 2014, Aachen, Germany, September 2 - 5, 2014.
participation von J.T. Witt
Symposium on Experimental Algorithms (SEA) 2014, Copenhagen, Denmark, June 29 - July 1, 2014.
participation von J.T. Witt

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.
Bastubbe, M., Lübbecke, M. and Witt, J.T.
A Computational Investigation on the Strength of Dantzig-Wolfe Reformulations. repORt 2018—047, February 2018. Published.
Witt, J.T., Lübbecke, M. and Reed, B.
Polyhedral results on the stable set problem in graphs containing even or odd pairs. repORt 2017—039, April 2017. Published.
Fischer, T., Gally, T., Gleixner, A.M., Hendel, G., Koch, T., Maher, S.J., Miltenberger, M., Müller, B., Pfetsch, M.E., Puchert, C., Rehfeldt, D., Schenker, S., Serrano, F., Shinano, Y., Vigerske, S., Weninger, D., Winkler, M., Witt, J.T., Witzig, J., Gamrath, G. and Schwarz, R.
The SCIP Optimization Suite 3.2. repORt 2016—031, February 2016.
Lübbecke, M. and Witt, J.T.
Dantzig-Wolfe Reformulations for the Stable Set Problem. repORt 2015—029, November 2015.
Witt, J.T. and Lübbecke, M.
Separation of Generic Cutting Planes in Branch-and-Price Using a Basis. repORt 2015—024, February 2015. Published.
Bergner, M., Lübbecke, M. and Witt, J.T.
A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs. repORt 2013—011, April 2013. Published.