atlas

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

Learning to Schedule Heuristics in Branch and Bound

NeurIPS 2021 · Learning theory and algorithms › Combinatorial and search optimization · approach: Learning branch-and-cut for MILP · 1 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
Use a learned schedule for diving heuristics instead of default heuristic settingsSCIP 7.0 · GISP, DIMACS graphsPrimal integral: 934.48 -> 470.73Helped
Use a learned schedule for diving heuristics instead of hand-tuned settingsSCIP 7.0 · GISP, DIMACS graphsPrimal integral: 555.75 -> 470.73Helped
Use a learned diving-heuristic schedule instead of default settingsSCIP 7.0 · GISP, random graphsRelative primal integral: 0.76 ± 0.25 -> 0.58 ± 0.20Helped
Include LNS heuristics in addition to diving heuristicsLearned GISP schedule · GISP, random graphsRelative primal integral: 0.86 ± 0.28 -> 0.86 ± 0.28Helped
Replace the proposed greedy schedule search with SMACHeuristic scheduling framework · GISP, random graphsPrimal integralHurt
Train a schedule on smaller instances and apply it to larger instancesLearned diving-heuristic schedule · GISP, random graphsRelative primal integral: 0.65 ± 0.24Helped

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