#

maximum-cut

Here are 5 public repositories matching this topic...

Thinklab-SJTU / ML4CO-Bench-101

ML4CO-Bench-101: Benchmark Machine Learning for Classic Combinatorial Problems on Graphs.

benchmark dataset generative-model maximum-independent-set cvrp tsp-problem combinatorial-optimization maximum-clique atsp diffusion-models maximum-cut consistency-models adaptive-expansion

Updated Nov 17, 2025
Python

hermish / cvx-graph-algorithms

Implementations of modern convex optimization-based graph algorithms in Python. Available on the Python Package Index (PyPI).

python graph-algorithms convex-optimization maximum-cut

Updated Jul 18, 2019
Python

tomdbar / ecord

Supporting code for "Learning to Solve Combinatorial Graph Partitioning Problems via Efficient Exploration".

reinforcement-learning pytorch publication combinatorial-optimization graph-neural-networks maximum-cut

Updated Jun 18, 2022
Python

lanl / custom-unembedding-algorithms-QA

Custom unembedding techniques for quantum annealers

python3 graph-partitioning quantum-annealing maximum-clique minimum-vertex-cover maximum-cut minor-embedding

Updated Jan 9, 2023
Python

victor99pekk / ML_4_MAXCUT

Research exploration of heuristic and learning-based methods for Max-Cut, conducted at UC San Diego

machine-learning deep-learning neural-network optimization combinatorics maximum-cut

Updated Nov 6, 2025
Python

Improve this page

Add a description, image, and links to the maximum-cut topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the maximum-cut topic, visit your repo's landing page and select "manage topics."