C⚙G - Imperial College London's repositories
min_matches_heuristics
Source code of the methods proposed in "Dimitrios Letsios, Georgia Kouyialis, Ruth Misener. Heuristics with Performance Guarantees for the Minimum Number of Matches Problem in Heat Recovery Network Design. Computers and Chemical Engineering 113:57-85, 2018".".
GNN_MIP_CAMD
Repository for paper: "Optimizing over trained GNNs via symmetry breaking".
PartitionedFormulations_NN
Implementation of partition-based formulations for mixed-integer optimization of trained ReLU neural networks
two_stage_scheduling
Exact lexicographic scheduling methods and approximate recovery strategies for two-stage makespan scheduling
galini-dashboard
Dashboard for the GALINI Solver
PoolingProblemDetection
F. Ceccon, G. Kouyialis, R. Misener, "Using functional programming to recognize named structure in an optimization problem: Application to pooling"
SDPCutSel-via-NN
Selecting cutting planes for quadratic semidefinite outer-approximation via trained neural networks
tidal_turbines-source_inversion
A repository for solving tidal stream turbine optimization with mixed-integer pde-constrained optimization
drill-scheduling
Pyomo implementation of a drill scheduling case study
points_in_circles
This repository contains a collection of MINLP test instances available in both .nl and .gms format.
StdPooling-PolyAlgos
Implementation of polynomial-time algorithms for subclasses of single quality standard pooling problems.