Jonas T. Witt

According to our database, Jonas T. Witt authored at least 6 papers between 2015 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2021

Avoiding redundant columns by adding classical Benders cuts to column generation subproblems.

Marco E. Lübbecke, Stephen J. Maher, Jonas T. Witt

Discret. Optim., 2021

2018

Polyhedral results on the stable set problem in graphs containing even or odd pairs.

Jonas T. Witt, Marco E. Lübbecke, Bruce A. Reed

Math. Program., 2018

The strength of Dantzig-Wolfe reformulations for the stable set and related problems.

Marco E. Lübbecke, Jonas T. Witt

Discret. Optim., 2018

A Computational Investigation on the Strength of Dantzig-Wolfe Reformulations.

Michael Bastubbe, Marco E. Lübbecke, Jonas T. Witt

Proceedings of the 17th International Symposium on Experimental Algorithms, 2018

2016

A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs.

Martin Bergner, Marco E. Lübbecke, Jonas T. Witt

ACM J. Exp. Algorithmics, 2016

2015

Separation of Generic Cutting Planes in Branch-and-Price Using a Basis.

Marco E. Lübbecke, Jonas T. Witt

Proceedings of the Experimental Algorithms - 14th International Symposium, 2015