A benchmarking suite for maximum independent set solvers.
☆52Feb 3, 2024Updated 2 years ago
Alternatives and similar repositories for mis-benchmark-framework
Users that are interested in mis-benchmark-framework are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- ☆24Dec 4, 2020Updated 5 years ago
- Maximum independent sets and vertex covers of large sparse graphs.☆87Sep 30, 2026Updated last month
- ☆48Apr 30, 2025Updated last year
- ☆16Apr 21, 2025Updated last year
- Implementation of ECO-DQN as reported in "Exploratory Combinatorial Optimization with Reinforcement Learning".☆81Oct 23, 2020Updated 6 years ago
- Virtual machines for every use case on DigitalOcean • AdGet dependable uptime with 99.99% SLA, simple security tools, and predictable monthly pricing with DigitalOcean's virtual machines, called Droplets.
- ☆161Feb 13, 2024Updated 2 years ago
- Supporting code for "Learning to Solve Combinatorial Graph Partitioning Problems via Efficient Exploration".☆13Jun 18, 2022Updated 4 years ago
- Code of NeurIPS paper: arxiv.org/abs/2302.08224☆266Sep 10, 2024Updated 2 years ago
- The repository for 'Unsupervised Learning for Combinatorial Optimization with Principled Proxy Design'☆16Oct 9, 2022Updated 4 years ago
- Official Repo for the NeurIPS2020 paper "Erdos Goes Neural: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs"☆53Apr 22, 2022Updated 4 years ago
- Reinforcement Learning for Cut Selection☆12Dec 8, 2022Updated 3 years ago
- Reimplementation of "Exact Combinatorial Optimization with Graph Convolutional Neural Networks" (NeurIPS 2019)☆49Aug 26, 2024Updated 2 years ago
- ☆12Sep 15, 2021Updated 5 years ago
- Extensible Combinatorial Optimization Learning Environments☆379Dec 20, 2025Updated 10 months ago
- Virtual machines for every use case on DigitalOcean • AdGet dependable uptime with 99.99% SLA, simple security tools, and predictable monthly pricing with DigitalOcean's virtual machines, called Droplets.
- Official Repository for the ICLR 2022 paper "Generalization of Neural Combinatorial Solvers through the Lens of Adversarial Robustness"☆13Nov 20, 2022Updated 3 years ago
- Simulated Annealing for MAX-CUT problems on {+1,-1}-weighted complete graphs☆12Feb 2, 2019Updated 7 years ago
- ☆14Nov 28, 2023Updated 2 years ago
- The Mixing method: coordinate descent for low-rank semidefinite programming☆15Apr 30, 2021Updated 5 years ago
- Code accompanying the manuscript "Constructions in combinatorics via neural networks and LP solvers".☆19Jul 4, 2021Updated 5 years ago
- Exact Combinatorial Optimization with Graph Convolutional Neural Networks (NeurIPS 2019)☆416Dec 21, 2021Updated 4 years ago
- Repository for the code of our ICLR paper: Backpropagation through Combinatorial Algorithms: Identity with Projection Works☆13Sep 29, 2024Updated 2 years ago
- Implementation of our NeurIPS 2021 paper "A Bi-Level Framework for Learning to Solve Combinatorial Optimization on Graphs".☆106Apr 19, 2023Updated 3 years ago
- An optimization-based algorithm to accurately estimate the causal effects and robustly predict under distribution shifts. It leverages th…☆14Jul 10, 2024Updated 2 years ago
- GPUs on demand by Runpod - Special Offer Available • AdRun AI, ML, and HPC workloads on powerful cloud GPUs—without limits or wasted spend. Deploy GPUs in under a minute and pay by the second.
- Code for the paper 'Learning TSP Requires Rethinking Generalization' (CP 2021)☆244Aug 26, 2021Updated 5 years ago
- A Simple CDCL Solver☆37Mar 8, 2023Updated 3 years ago
- Official Implementation of Our ICLR 2023 paper "ROCO: A General Framework for Evaluating Robustness of Combinatorial Optimization Solvers…☆20Oct 23, 2024Updated 2 years ago
- An official implementation of "Joint Inference of Diffusion and Structure in Partially Observed Social Networks Using Coupled Matrix Fact…☆10Sep 26, 2023Updated 3 years ago
- ☆33Sep 18, 2022Updated 4 years ago
- ☆90Aug 5, 2022Updated 4 years ago
- Algorithms course project to implement branch and bound algorithm on minimum vertex cover problem.☆10Aug 5, 2019Updated 7 years ago
- ☆22Mar 23, 2022Updated 4 years ago
- Code for our NeurIPS 2019 paper "Quantum Embedding of Knowledge for Reasoning" (authors: Dinesh Garg, Shajith Ikbal, Santosh K Srivastava…☆26Oct 14, 2020Updated 6 years ago
- Serverless GPU API endpoints on Runpod - Get Bonus Credits • AdSkip the infrastructure headaches. Auto-scaling, pay-as-you-go, no-ops approach lets you focus on innovating your application.
- Optimal gate sizing of digital circuits using geometric programming☆11Aug 18, 2016Updated 10 years ago
- A Branch-and-Cut based Pricer for the Capacitated Vehicle Routing Problem☆16Jun 16, 2023Updated 3 years ago
- Hybrid Models for Learning to Branch (NeurIPS 2020)☆50May 31, 2021Updated 5 years ago
- ☆133Nov 7, 2022Updated 3 years ago
- DISCS: The code base for the Benchmark for Discrete Sampling☆63Aug 20, 2024Updated 2 years ago
- Winning Solver of PACE Challenge 2019 Track A☆13Mar 12, 2026Updated 7 months ago
- ☆20May 11, 2023Updated 3 years ago