MaxiBoether / mis-benchmark-frameworkLinks
A benchmarking suite for maximum independent set solvers.
☆51Updated last year
Alternatives and similar repositories for mis-benchmark-framework
Users that are interested in mis-benchmark-framework are comparing it to the libraries listed below
Sorting:
- Official Repo for the NeurIPS2020 paper "Erdos Goes Neural: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs"☆49Updated 3 years ago
- This is the code for G2MILP, a deep learning-based mixed-integer linear programming (MILP) instance generator.☆31Updated 8 months ago
- ☆26Updated 4 years ago
- Implementation of ECO-DQN as reported in "Exploratory Combinatorial Optimization with Reinforcement Learning".☆80Updated 4 years ago
- Implementation of our NeurIPS 2021 paper "A Bi-Level Framework for Learning to Solve Combinatorial Optimization on Graphs".☆100Updated 2 years ago
- The repository for 'Unsupervised Learning for Combinatorial Optimization with Principled Proxy Design'☆16Updated 2 years ago
- ☆42Updated last month
- PyTorch implementation for our NeurIPS 2023 spotlight paper "Let the Flows Tell: Solving Graph Combinatorial Optimization Problems with G…☆64Updated 2 years ago
- Reinforcement Learning for Cut Selection☆11Updated 2 years ago
- Official Repository for the ICLR 2022 paper "Generalization of Neural Combinatorial Solvers through the Lens of Adversarial Robustness"☆14Updated 2 years ago
- Reimplementation of "Exact Combinatorial Optimization with Graph Convolutional Neural Networks" (NeurIPS 2019)☆38Updated 9 months ago
- ☆155Updated last year
- ☆35Updated 2 years ago
- ☆37Updated 6 years ago
- ☆23Updated last year
- ☆11Updated 3 years ago
- Predict and search framework for MilP☆53Updated 2 years ago
- Learning a Latent Search Space for Routing Problems using Variational Autoencoders☆26Updated 3 years ago
- Representing CP problems as graphs☆19Updated 5 months ago
- ☆26Updated last year
- Machine Learning for Combinatorial Optimization - NeurIPS'21 competition☆135Updated 2 years ago
- Hybrid Models for Learning to Branch (NeurIPS 2020)☆50Updated 4 years ago
- [ICLR 2023] "On Representing Mixed-Integer Linear Programs by Graph Neural Networks" by Ziang Chen, Jialin Liu, Xinshang Wang, Jianfeng L…☆51Updated last year
- the official repository of the paper unsupervised learning for combinatorial optimization needs meta learning☆9Updated 2 years ago
- ☆31Updated 2 years ago
- Parameterizing Branch-and-Bound Search Trees to Learn Branching Policies (AAAI 2021)☆67Updated 3 years ago
- Codes for AAAI22 paper "Learning to Solve Travelling Salesman Problem with Hardness-Adaptive Curriculum"☆22Updated 3 years ago
- Learning local search heuristics for Boolean satisfiability☆37Updated last year
- Combinatorial Optimization with Graph Convolutional Networks and Guided Tree Search☆154Updated 9 months ago
- Code of NeurIPS paper: arxiv.org/abs/2302.08224☆202Updated 8 months ago