cog-imperial/min_matches_heuristics

Stars
6
Rank 2,539,965 (Top 51 %)
Language GAMS
License
Apache License 2.0
Created about 7 years ago
Updated over 5 years ago

cog-imperial/min_matches_heuristics

cog-imperial

There are no reviews yet. Be the first to send feedback to the community and the maintainers!

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".".

OMLT

Represent trained machine learning models as Pyomo optimization formulations

romodel

Modeling robust optimization problems in Pyomo

entmoot

Multiobjective black-box optimization using gradient-boosted trees

galini

An extensible MINLP solver

GPdoemd

Design of experiments for model discrimination using Gaussian process surrogate models

suspect

Special Structure Detection for Pyomo

SnAKe

Repository for paper: "SnAKe: Bayesian Optimization with Pathwise Exploration".

pooling-network

tree_kernel_gp

pypopt

Bindings to Ipopt C++ library for Python. 🐍

rogp

Modeling Gaussian Processes in Pyomo

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

GNN_MIP_CAMD

Repository for paper: "Optimizing over trained GNNs via symmetry breaking".

OMLT_CAMD

Repository for paper: "Augmenting optimization-based molecular design with graph neural networks".

galini-dashboard

Dashboard for the GALINI Solver

DCBO

Repository for paper: "Dependence in constrained Bayesian optimization: When do we need it and how does it help?".

Partial-Lasserre-relaxation-sparse-maxcut

drill-scheduling

Pyomo implementation of a drill scheduling case study

moo_trees