Research map / Graph learning / Graph algorithms and clustering
Learning to Compare Nodes in Branch and Bound with Graph Neural Networks
Abdel Ghani Labassi, Didier Chételat, Andrea Lodi
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 changed | Where | Measured | Effect |
|---|---|---|---|
| Use the bipartite-graph siamese GNN node comparator instead of SCIP's default node selection | SCIP branch-and-bound · Test FCMCNF | nodes: 41±5 -> 19±5 | Improved |
| Use the bipartite-graph siamese GNN node comparator instead of SCIP's default node selection | SCIP branch-and-bound · Test MAXSAT | time (seconds): 9.26±1.5 -> 6.66±1.9 | Improved |
| Use the bipartite-graph siamese GNN node comparator instead of SCIP's default node selection | SCIP branch-and-bound · Transfer MAXSAT | nodes: 171±2 -> 171±2 | No clear effect |
| Use the bipartite-graph siamese GNN node comparator instead of SCIP's default node selection | SCIP branch-and-bound · Transfer GISP | time (seconds): 19.1±1.5 -> 22.8±1.5 | Hurt |
| Use the bipartite-graph siamese GNN node comparator instead of SCIP's default node selection | SCIP branch-and-bound · Transfer FCMCNF | nodes: 178±4 -> 122±5 | Improved |
| Use the bipartite-graph siamese GNN node comparator instead of SCIP's default node selection | SCIP branch-and-bound · Test GISP | time (seconds): 4.38±1.2 -> 4.64±1.3 | Hurt |
| Use a graph neural network instead of the fixed-feature MLP comparator | Learned node comparison · Test MAXSAT | nodes: 157±3 -> 117±3 | Improved |
| Use a graph neural network instead of the fixed-feature MLP comparator | Learned node comparison · Transfer FCMCNF | nodes: 115±5 -> 122±5 | Mixed |
Closest papers by meaning
- Rethinking the Capacity of Graph Neural Networks for Branching Strategy (NeurIPS 2024 · similarity 0.88)
- BIPNN: Learning to Solve Binary Integer Programming via Hypergraph Neural Networks (NeurIPS 2025 · similarity 0.87)
- Are Graph Neural Networks Optimal Approximation Algorithms? (NeurIPS 2024 · similarity 0.87)
- Sample Complexity of Algorithm Selection Using Neural Networks and Its Applications to Branch-and-Cut (NeurIPS 2024 · similarity 0.86)
- Generalization Guarantees for Learning Score-Based Branch-and-Cut Policies in Integer Programming (NeurIPS 2025 · similarity 0.86)
- Learning Cut Generating Functions for Integer Programming (NeurIPS 2024 · similarity 0.85)
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.
