This site provides links to both code and problem instances used in my publications. The links to code are grouped by the following topics:

Clustering

Coding Theory

Kidney Exchange

Neural Networks

Oracle Models for Convex Optimization

Relaxation Complexity

code

Projects with Code

code

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, 2023

is available here.

code

Coding Theory

The code and instances used in the article

The Role of the Alphabet in Network Coding: An Optimization Approach
with: Altan B. Kılıç and Alberto Ravagnani

is available here.

code

Kidney Exchange Problems

The code and instances used in the article

Cutting Plane Approaches for the Robust Kidney Exchange Problem
with: Danny Blom and Bart Smeulders, 2022

is available here.

code

Neural Networks

The code and instances used in the article

Verifying message-passing neural networks via topology-based bounds tightening
with: Shiqiang Zhang, Juan S. Campos, and Ruth Misener, 2024

is available here.

convex optimization

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.

code

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.

instances

Problem Instances

connected cut

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.

OR scheduling

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.