Thinklab-SJTU/COExpander

Official implementation of "COExpander: Adaptive Solution Expansion for Combinatorial Optimization".

15
/ 100
Experimental

COExpander is a tool for tackling complex combinatorial optimization problems, like finding the shortest routes or efficient resource allocations. It takes in large problem instances, often represented as graphs with many nodes (up to 10,000), and outputs high-quality, optimized solutions. This is useful for researchers and practitioners who need to solve difficult planning or scheduling challenges that are too large or intricate for traditional methods.

No commits in the last 6 months.

Use this if you are working with large-scale combinatorial optimization problems (e.g., maximum independent set, traveling salesman, minimum vertex cover) and need to find state-of-the-art solutions efficiently.

Not ideal if you are looking for an off-the-shelf application to solve specific business problems without any programming or machine learning setup.

operations-research combinatorial-optimization logistics-planning resource-allocation graph-algorithms
No License Stale 6m No Package No Dependents
Maintenance 2 / 25
Adoption 6 / 25
Maturity 7 / 25
Community 0 / 25

How are scores calculated?

Stars

21

Forks

Language

Python

License

Last pushed

Jun 28, 2025

Commits (30d)

0

Get this data via API

curl "https://pt-edge.onrender.com/api/v1/quality/diffusion/Thinklab-SJTU/COExpander"

Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.