MaxiBoether / mis-benchmark-frameworkLinks
A benchmarking suite for maximum independent set solvers.
☆53Updated 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:
- ☆160Updated last year
- Official Repo for the NeurIPS2020 paper "Erdos Goes Neural: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs"☆50Updated 3 years ago
- The repository for 'Unsupervised Learning for Combinatorial Optimization with Principled Proxy Design'☆16Updated 2 years ago
- Code of NeurIPS paper: arxiv.org/abs/2302.08224☆223Updated last year
- This is the code for G2MILP, a deep learning-based mixed-integer linear programming (MILP) instance generator.☆34Updated last year
- ☆37Updated 6 years ago
- Implementation of ECO-DQN as reported in "Exploratory Combinatorial Optimization with Reinforcement Learning".☆80Updated 4 years ago
- Graph Neural Network architecture to solve the decision variant of the Traveling Salesperson Problem (is there a Hamiltonian tour in G wi…☆117Updated 5 years ago
- Implementation of our NeurIPS 2021 paper "A Bi-Level Framework for Learning to Solve Combinatorial Optimization on Graphs".☆101Updated 2 years ago
- ☆27Updated 4 years ago
- ☆43Updated 5 months ago
- Reinforcement Learning for Cut Selection☆11Updated 2 years ago
- ☆23Updated last year
- ☆35Updated 2 years ago
- PyTorch implementation for our NeurIPS 2023 spotlight paper "Let the Flows Tell: Solving Graph Combinatorial Optimization Problems with G…☆66Updated 2 years ago
- ☆11Updated 4 years ago
- Machine Learning for Combinatorial Optimization - NeurIPS'21 competition☆137Updated 3 years ago
- Code for the paper 'Learning TSP Requires Rethinking Generalization' (CP 2021)☆235Updated 4 years ago
- ML4CO-Bench-101: Benchmark Machine Learning for Classic Combinatorial Problems on Graphs.☆23Updated 2 weeks ago
- Supporting code for "Learning to Solve Combinatorial Graph Partitioning Problems via Efficient Exploration".☆14Updated 3 years ago
- Representing CP problems as graphs☆19Updated 9 months ago
- [ICLR 2023 spotlight] "On Representing Linear Programs by Graph Neural Networks" by Ziang Chen, Jialin Liu, Xinshang Wang, Jianfeng Lu, W…☆36Updated last week
- Code for the paper 'An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem' (INFORMS Annual Meeting Sessi…☆324Updated 3 years ago
- Learning a Latent Search Space for Routing Problems using Variational Autoencoders☆28Updated 4 years ago
- Code for our paper: ACM-MILP: Adaptive Constraint Modification via Grouping and Selection for Hardness-Preserving MILP Instance Generatio…☆13Updated 9 months ago
- Learning local search heuristics for Boolean satisfiability☆37Updated last year
- Reimplementation of "Exact Combinatorial Optimization with Graph Convolutional Neural Networks" (NeurIPS 2019)☆43Updated last year
- Official Repository for the ICLR 2022 paper "Generalization of Neural Combinatorial Solvers through the Lens of Adversarial Robustness"☆14Updated 2 years ago
- ☆30Updated last year
- [ICML 2023] Meta-SAGE: Scale Meta-Learning Scheduled Adaptation with Guided Exploration for Mitigating Scale Shift on Combinatorial Optim…☆10Updated last year