Research Data

This site provides links to problem instances used in my publications.

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.