Towards General Algorithm Discovery for Combinatorial Optimization: Learning Symbolic Branching Policy from Bipartite Graph

Yufei Kuang, Jie Wang, Yuyan Zhou, Xijun Li, Fangzhou Zhu +2 more
2/12/2026

No official code found. Best implementation: MIRALab-USTC/L2O-GS4CO (3 stars, last commit 2024-08-13).

Semantic Scholar

Code Implementations(1)

MIRALab-USTC/L2O-GS4COCommunity58%

The code of paper *Towards General Algorithm Discovery for Combinatorial Optimization: Learning Symbolic Branching Policy from Bipartite Graph*.

31PythonJun 3, 20242 years ago

Similar Papers

Reinforced Learning Explicit Circuit Representations for Quantum State Characterization from Local Measurements

96% match2026

Sequential Preference Ranking for Efficient Reinforcement Learning from Human Feedback

96% match2026

Scalable Multiple Kernel Clustering: Learning Clustering Structure from Expectation

95% match2026

EEG2Video: Towards Decoding Dynamic Visual Perception from EEG Signals

95% match2026

DyCAST: Learning Dynamic Causal Structure from Time Series

95% match1 repo32026

MaskPLAN: Masked Generative Layout Planning from Partial Input

95% match1 repo152026

Cite this paper

@article{kuang2026towards,
  title  = {Towards General Algorithm Discovery for Combinatorial Optimization: Learning Symbolic Branching Policy from Bipartite Graph},
  author = {Yufei Kuang and Jie Wang and Yuyan Zhou and Xijun Li and Fangzhou Zhu and Jianye Hao and Feng Wu},
  year   = {2026},
  url    = {https://api.semanticscholar.org/CorpusID:433009cbbf7cf83a71a9ffb78666920a19f8335b},
  journal = {ICML 2024 2024}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/433009cbbf7cf83a71a9ffb78666920a19f8335b.svg)](https://codeofpaper.com/paper/433009cbbf7cf83a71a9ffb78666920a19f8335b)

Discussion