Projects with Code

Kidney Exchange Problems

The code and instances used in the article

A Benders-type Approach for Robust Optimization of Kidney Exchanges under Full Recourse
with: Danny Blom and Bart Smeulders, 2021

is available here.

Minimum Sums-of-Squares Clustering

The code and instances used in the article

Mixed-Integer Programming Techniques for the Minimum Sum-of-Squares Clustering Problem
with Jan Pablo Burgard, Carina Moreira Costa, Thomas Kleinert, and Martin Schmidt, 2022

is available here.

Network Codes

The code and instances used in the article

Network Coding: An Optimization Approach
with: Altan B. Kılıç and Alberto Ravagnani

is available here.

Oracle Methods for Convex Optimization

The code and instances used in the article

A Simple Method for Convex Optimization in the Oracle Model
with: Daniel Dadush, Sophie Huiberts, and Stefan Weltge

is available here.

Relaxation Complexity

The code and instances used in the articles

Efficient MIP Techniques for Computing the Relaxation Complexity
with: Gennadiy Averkov and Matthias Schymura

Computations aspects of relaxation complexity: possibilities and limitations
with: Gennadiy Averkov and Matthias Schymura

is available here.

Problem Instances

Connected Maximum Cut Problem

The randomly generated instances of the connected maximum cut problem used in the article

Mixed-integer programming techniques for the connected max-k-cut problem
with: Imke Joormann, Hendrik Lüthen, and Martin Schmidt

in DIMACS graph format are available here.

Operation Room Scheduling Problem

The instances of the operation room scheduling problem used in the article Packing, partitioning, and covering symresacks in LP format are available here. The compressed folder also contains a script to generate random instances,
see the README for more details.