ds4dm/milp-outcome ds4dm/milp-outcome

  • Stars
    star
    3
  • Rank 3,963,521 (Top 79 %)
  • Language
    Jupyter Notebook
  • License
    MIT License
  • Created over 4 years ago
  • Updated over 3 years ago
Twitter logo Share LinkedIn logo Share Facebook logo Share
ds4dm/milp-outcome
github

ds4dm

Reviews

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

Repository Details

More Repositories

1

learn2branch

Exact Combinatorial Optimization with Graph Convolutional Neural Networks (NeurIPS 2019)
Python
344
star
2

ecole

Extensible Combinatorial Optimization Learning Environments
C++
316
star
3

Tulip.jl

Interior-point solver in pure Julia
Julia
154
star
4

ml4co-competition

Machine Learning for Combinatorial Optimization - NeurIPS'21 competition
Python
125
star
5

branch-search-trees

Parameterizing Branch-and-Bound Search Trees to Learn Branching Policies (AAAI 2021)
Python
64
star
6

learn2branch-ecole

Reimplementation of "Exact Combinatorial Optimization with Graph Convolutional Neural Networks" (NeurIPS 2019)
Python
32
star
7

learn2comparenodes

Learning to Compare Nodes in Branch and Bound with Graph Neural Networks (NeurIPS 2022)
Jupyter Notebook
18
star
8

sparse-gcn

Sparse graph attention
Python
17
star
9

Bliss

Fork of Bliss
C++
12
star
10

ZERO

ZERO is a modular C++ library interfacing Mathematical Programming and Game Theory.
C++
9
star
11

singularity-conda

A Singularity recipe that properly initialize a conda environment
Shell
8
star
12

EPECInstances

An Instance generator for NASPs (Nash Games among Stackelberg Players)
Python
8
star
13

PySVMRank

Python API for SVMrank (http://www.cs.cornell.edu/people/tj/svm_light/svm_rank.html)
Python
7
star
14

nectar

Codebase for "A learning-based algorithm to quickly compute good primal solutions for Stochastic Integer Programs"
Python
4
star
15

tipsntricks

Tips, tricks and setup information at the chair
HTML
3
star
16

miqp-clf2lin

Python
3
star
17

ml4co-competition-hidden

Machine Learning for Combinatorial Optimization - NeurIPS'21 competition (hidden code)
Python
3
star
18

CNG-Instances

Instances and results for the Critical Node Game
2
star
19

ecole-paper

Compare Ecole and Gasse et al. 2019 implementations
Jupyter Notebook
1
star
20

amcts-cplex

Asynchronous Monte-Carlo Tree Search (AMCTS) implementation for learning to branch in CPLEX.
Jupyter Notebook
1
star
21

GraphRL

Python
1
star
22

IrratDCM

"On the estimation of discrete choice models to capture irrational customer behaviors" by Jena et al. (2021)
1
star