AI Paper Atlas

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

Learning To Dive In Branch And Bound

Max B. Paulus, Andreas Krause

NeurIPS 2023 · Learning theory and algorithms › Combinatorial and search optimization · approach: Learning branch-and-cut for MILP · 2 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
Use Learning To Dive instead of the best standard diverDiving heuristic · Set Cover testprimal gap: 95 (3) -> 55 (3)Improved
Use Learning To Dive instead of the best standard diverDiving heuristic · Combinatorial Auction testprimal gap: 256 (8) -> 222 (7)Improved
Use Learning To Dive instead of FarkasDiving heuristic · Facility Location testprimal gap: 484 (7) -> 160 (10)Improved
Use Learning To Dive instead of VectorlengthDiving heuristic · Independent Set testprimal gap: 18 (1) -> 5 (1)Improved
Replace the tuned SCIP diving ensemble with Learning To DiveSCIP 7.0.2 · Server Load Balancing testprimal-dual integral: 3,067 (10) -> 2,863 (13)Improved
Replace the tuned SCIP diving ensemble with Learning To DiveSCIP 7.0.2 · Neural Network Verification testsolving time: 49.9 (2.8) -> 39.8 (2.3)Improved

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