Learning to Select Nodes in Branch and Bound with Sufficient Tree Representation

Sijia Zhang, Shuli Zeng, Shaoang Li, Feng Wu, Xiangyang Li
2/12/2026

No confident code implementation found for this paper.

Semantic Scholar

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Descent with Misaligned Gradients and Applications to Hidden Convexity

92% match2026

On Double Descent in Reinforcement Learning with LSTD and Random Features

91% match2026

Tuning Frequency Bias in Neural Network Training with Nonuniform Data

91% match2026

Principled Bayesian Optimization in Collaboration with Human Experts

91% match1 repo32026

Representation Surgery in Model Merging with Probabilistic Modeling

91% match1 repo32026

Understanding Optimization in Deep Learning with Central Flows

91% match2026

Cite this paper

@article{zhang2026learning,
  title  = {Learning to Select Nodes in Branch and Bound with Sufficient Tree Representation},
  author = {Sijia Zhang and Shuli Zeng and Shaoang Li and Feng Wu and Xiangyang Li},
  year   = {2026},
  url    = {https://api.semanticscholar.org/CorpusID:2a4b9e1867c335f9187c965ade4ef818e0376d93},
  journal = {ICLR 2025 2025}
}

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/2a4b9e1867c335f9187c965ade4ef818e0376d93.svg)](https://codeofpaper.com/paper/2a4b9e1867c335f9187c965ade4ef818e0376d93)

Discussion