Research map / Learning theory and algorithms / Combinatorial and search optimization
Generative Branching for Mixed-Integer Linear Programming
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.
Closest papers by meaning
- Parameterizing Branch-and-Bound Search Trees to Learn Branching Policies (AAAI 2021 · similarity 0.94)
- CAMBranch: Contrastive Learning with Augmented MILPs for Branching (ICLR 2024 · similarity 0.92)
- Generalization Guarantees for Learning Score-Based Branch-and-Cut Policies in Integer Programming (NeurIPS 2025 · similarity 0.90)
- Rethinking the Capacity of Graph Neural Networks for Branching Strategy (NeurIPS 2024 · similarity 0.88)
- Learning Cut Generating Functions for Integer Programming (NeurIPS 2024 · similarity 0.88)
- Search Strategy Generation for Branch and Bound Using Genetic Programming (AAAI 2025 · similarity 0.87)
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.