Reduce several arbitrary-connectivity optimization problems into maximum independent set problems on a grid
-
Updated
Apr 12, 2025 - Julia
Reduce several arbitrary-connectivity optimization problems into maximum independent set problems on a grid
ML4CO-Bench-101: Benchmark Machine Learning for Classic Combinatorial Problems on Graphs.
Automated discovery of optimal branching rules for the branch-and-bound algorithm
Official Implementation of the NeurIPS'23 paper 'Maximum Independent Set: Self-Training through Dynamic Programming'.
This repository provides a collection of advanced solvers for the Maximum Independent Set (MIS) problem, leveraging various optimization techniques and tools. It includes implementations of solvers using Gurobi, Google OR-Tools, and dataless neural networks (dNNs), alongside the focus of this repo, pCQO MIS
A solver for the maximum(-weight) independent set and the maximum(-weight) clique problems
This program solves the 5x5x5 brick-cube-puzzle in less than one second by transforming it to a minimal-vertex-cover problem.
Maximum independent set problem solver
Online Maximum Independent Set of Hyperrectangles
Solution to a maximum independent set problem
Predicting the secondary structure of RNA
Maximum Independent Set (MIS) Algorithms implented in NetLogo
Maximum independent set problem - greedy and brute force parallel algorithms
Maximum Independent Set Template
This repository contains the code used in the CS301 (Algorithms) Project which discusses the Maximum Independent Set Problem
Dynamic programming
Add a description, image, and links to the maximum-independent-set topic page so that developers can more easily learn about it.
To associate your repository with the maximum-independent-set topic, visit your repo's landing page and select "manage topics."