atlas

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

Rethinking Branching on Exact Combinatorial Optimization Solver: The First Deep Symbolic Discovery Framework

ICLR 2024 · Learning theory and algorithms › Combinatorial and search optimization · approach: Unsupervised neural combinatorial optimization

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's abstract only. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes a deep symbolic discovery framework that automatically discovers interpretable, lightweight branching policies for exact combinatorial optimization solvers under branch and bound.

Problem

ML-based branching for NP-hard combinatorial optimization in branch and bound is costly to train and run and hard to interpret, while human-designed branching policies are cheap but hand-crafted and suboptimal.

Approach

Uses deep symbolic discovery to search for compact symbolic branching rules that retain the efficiency and interpretability of human-designed heuristics while approaching learned-policy performance.

Experimental setup

Baselines: human-designed branching heuristics learning-based branching policies

Builds on: branch and bound strong branching

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