atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Learning to Branch in Mixed Integer Programming

AAAI 2016 · Learning theory and algorithms › Combinatorial and search optimization · approach: Search for program synthesis · 306 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (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
replace pseudocost branching after 500 nodes with an instance-specific learned SVMrank model imitating strong branchingSB+PC · MIP instances, Allnumber of nodes: 70,455 -> 59,223Helped
learned branching (SB+ML) vs pseudocost branchingPC · MIP instances, Allunsolved instances: 66 -> 52Helped
learned branching (SB+ML) vs pseudocost branchingPC · MIP instancestotal time: 10% slower on All; 28% and 14% faster on Medium and HardMixed
learned branching (SB+ML) vs CPLEX defaultCPLEX-D · MIP instances solved by bothnumber of nodes: only 3% more nodes than CPLEX-DNo clear effect
varying alpha in {0.1..0.5} and SVMrank C in {0.001..1} (ablation)SB+ML · MIP instancesperformanceNo clear effect

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