AI Paper Atlas

Research map / Large language models / Agents, code and math

LLM4Branch: Large Language Model for Discovering Efficient Branching Policies of Integer Programs

Zhinan Hou, Xingchen Li, Yankai Zhang, Tianxun Li, Keyou You

ICML 2026 · Large language models › Agents, code and math · approach: LLM-guided program synthesis · 0 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
optimize solver cost instead of strong-branching imitation accuracy (ablation)LLM4Branch · Setcover (Easy)solving time (s): 3.88 -> 3.21Improved
optimize solver cost instead of strong-branching imitation accuracy (ablation)LLM4Branch · Indset (Easy)solving time (s): 45.21 -> 10.91Improved
add parameter optimization stage (ablation)LLM4Branch · Setcover (Easy)solving time (s): 4.53 -> 3.21Improved
add parameter optimization stage (ablation)LLM4Branch · Indset (Easy)solving time (s): 28.09 -> 10.91Improved
add natural-language feature description (prior) to prompt (ablation)LLM4Branch · Setcover (Easy)solving time (s): 4.10 -> 3.21Improved
add natural-language feature description (prior) to prompt (ablation)LLM4Branch · Indset (Easy)solving time (s): 17.03 -> 10.91Improved
change LLM backbone from DeepSeek-R1 to GPT-5, DeepSeek-V3 or Qwen3-Next-80B-A3B (ablation)LLM4Branch · Setcover (Easy)solving time (s): 3.21 vs 3.25, 3.39, 3.55No clear effect
change LLM backbone from DeepSeek-R1 to GPT-5, DeepSeek-V3 or Qwen3-Next-80B-A3B (ablation)LLM4Branch · Indset (Easy)solving time (s): 10.91 vs 9.01, 9.34, 10.52No clear effect
select MLP checkpoint by solving time rather than loss or accuracy (ablation)MLP policy · Indset (500 nodes, affinity 4)solve time (s): 3.047 -> 3.016Improved
select MLP checkpoint by highest accuracy rather than lowest loss (ablation)MLP policy · Indset (500 nodes, affinity 4)solve time (s): 3.047 -> 3.044No clear effect
use LLM-discovered policy instead of GNN imitating strong branchingLLM4Branch · Indset (Easy)strong-branching accuracy (%): 48.84 -> 24.72Hurt
use LLM4Branch instead of HybridHybrid · Indset (Medium)solving time (s): 112.48 -> 62.45Improved

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy