v1.3.0

This version of the code was used to run the experiments for the IPCO 2026 submission "Parametric Disjunctive Cuts for Sequences of Mixed Integer Linear Optimization Problems". This version also added the ability to use Symphony as the underlying MILP solver.

v1.2.0

This version of the code was used to run the experiments for "Strengthening Parametric Disjunctive Cuts". This version added the ability to strengthening parametric disjunctive cuts in two ways:

• use an incumbent solution to prune the disjunction prior to parametric disjunctive cut
• recalculate the farkas certificate for a parametric disjunctive cut such that when the cut is regenerated it supports the disjunctive hull

For more details, see the paper "Strengthening Parametric Disjunctive Cuts".

v1.1.1

Release for the state of the code matching my draft submission of "Warm-Starting Series of Mixed-Integer Linear Programs via Parametric Disjunctive Cuts". The main contribution here is bug fixes to parametric disjunctive cut generation.

v1.1.0

Tagging the code used for IPCO submission "Warm Starting of Mixed Integer Linear Optimization Problems via Parametric Disjunctive Cuts" 11/7/23.

Main update in this release is enablement of parameterization of all parts of a MILP.

v1.0.0

This marks the point in the code base used for MIPcc 2023. It works (mostly), but documentation, parameter handling, and bug fix needs abound.

v0.0.0

A barebones implementation that reads in the files and solves their LP relaxations. Simple catch unit tests are set up too.