Overview

Branch and bound solves hard optimization and verification problems by splitting them into subproblems, using lower and upper bounds to discard regions that cannot improve the best known solution. Work spans mixed-integer programming, neural-network verification, geometric estimation, routing, and robust regression, with stronger relaxations and problem-specific bounds helping reduce search. Another major direction learns branching and node-selection policies, while parallel CPU–GPU search and hybrid exact–heuristic methods target larger instances. The central tension is to make search faster and more scalable without weakening the guarantees that distinguish exact methods.

Latest papers

CardsList

33 papers5 papers in the last four weeks, up 25% on the four weeks before. 0.0% of all new papers.

  1. Two Communities, One Problem: Branch-and-Bound vs. A* for Resource-Constrained Project Scheduling

    Nov 10, 2026Izack Cohen, Dominik Kress, Lara Nehrke +2Branch and BoundTree Search

  2. Learning to Bound: Monotonic, Calibrated Neural Upper Bounds for MPE Inference

    Oct 29, 2026Akshay Vyas, Hailiang Dong, Shivvrat Arya +4Probabilistic Graphical ModelsAmortized Inference

  3. Evo-B&B: Behavior-Aware LLM-Guided Joint Evolution of Branching and Node Selection Policies for MILP

    Oct 16, 2026Jiayu Chen, Chentong Chen, Yuhan Liu +3Branch and BoundMixed-Integer Linear Programming

  4. Sequence-Structured Decision Learning for Branch-and-Bound in Mixed-Integer Linear Programming

    Oct 10, 2026Tengfei Liu, Jinrun Liu, Bai Yan +2Branch and BoundMixed-Integer Linear Programming

  5. BiFE: Search-Efficient Discovery of CPU-Only Branching Policies via LLM-based Bi-Fidelity Evolution

    Sep 29, 2026Ce Zhang, Bin Zhang, Zhiwei Xu +5Multi-Fidelity OptimizationAutomated Algorithm Discovery

  6. Verifying Neural Networks with Reinforcement Learning

    Sep 28, 2026Hai Duong, Thanh Le, ThanhVu NguyenNeural Network VerificationBranch and Bound

  7. A Moving-Horizon Approximate Branch-and-Reduce Method for Deep Classification Trees

    Sep 18, 2026Chenxuanyin Zou, Jiayang Ren, Qiangqiang Mao +3Decision Tree LearningBranch and Bound

  8. Closing the Loop: Branch-and-Bound for Scalable Verification of Nonlinear Neural Feedback Systems

    Sep 14, 2026I. Samuel Akinwande, Mykel J. Kochenderfer, Clark BarrettNeural Network VerificationBranch and Bound

  9. Sparsity Regularized and Robust Mean Variance Portfolio Selection Under Ellipsoidal Uncertainty

    Sep 10, 2026Deniz Akkaya, Emre Can Yayla, Buse Şen +1Branch and BoundPortfolio Optimization

  10. Unified Branch-and-Bound Search for the Steiner Traveling Salesman Problem on Graphs of Convex Sets

    Aug 21, 2026Jingtao Tang, Hang MaTraveling Salesperson ProblemBranch and Bound

  11. Optimizing Minimax Regret in Uncertain MDPs with Small Sets of Policies

    Aug 3, 2026Sterre Lutz, Daniël Vos, Matthijs T. J. Spaan +1Markov Decision ProcessesBranch and Bound

  12. Mining Verdict Boundaries for Neural Network Verification

    Jul 31, 2026Jiawei Ren, Guanqin Zhang, Zhenya Zhang +1Neural Network VerificationBranch and Bound

  13. Lookahead Branching for Neural Network Verification

    Jul 19, 2026Liam Davis, Duo Zhou, Huan Zhang +3Neural Network VerificationBranch and Bound

  14. Dynamical Vehicle Orienteering Problem for Multi-Rotor Unmanned Aerial Vehicles

    Jul 15, 2026František Nekovář, Matej Novosad, Martin Saska +1Trajectory OptimizationBranch and Bound

  15. Dual-Informed Vertical Expansion for Multi-Objective Node Selection in Anytime Conflict-Based Search

    Jun 30, 2026Willem van Osselaer, Jiarui Li, Meshal Alharbi +1Branch and BoundTree Search

  16. Multi-Agent Goal Recognition with Team- and Goal-Conditioned Reinforcement Learning and Factorized Branch-and-Bound

    Jun 24, 2026Thiago Thomas, Gabriel de Oliveira Ramos, Felipe MeneguzziBranch and BoundMulti-Agent Systems

  17. Cost-Optimal Decision Diagrams for Stochastic Boolean Function Evaluation

    Jun 23, 2026Xia Zong, Tuomo Lehtonen, Jussi RintanenBranch and BoundCost-Aware Inference

  18. Bidirectional Search for Longest Paths: Case for Front-to-Front Heuristics

    Jun 4, 2026Tzur Shubi, Ariel Felner, Solomon Eyal Shimony +1Branch and BoundTree Search

  19. From Sequential Nodes to GPU Batches: Parallel Branch and Bound for Optimal kk-Sparse GLMs

    May 21, 2026Jiachang Liu, Andrea LodiBranch and BoundGPU Kernel Optimization

  20. LLM4Branch: Large Language Model for Discovering Efficient Branching Policies of Integer Programs

    May 11, 2026Zhinan Hou, Xingchen Li, Yankai Zhang +2Branch and BoundMixed-Integer Linear Programming

  21. Solving Max-Cut to Global Optimality via Feasibility-Preserving Graph Neural Networks

    May 8, 2026Hao Chen, Chendi Qian, Christopher Morris +2Max-CutSemidefinite Programming

  22. Computation of Least Trimmed Squares: A Branch-and-Bound framework with Hyperplane Arrangement Enhancements

    Apr 13, 2026Xiang Meng, Andrés Gómez, Rahul MazumderRobust RegressionRobust Statistics

  23. Speeding Up Mixed-Integer Programming Solvers with Sparse Learning for Branching

    Mar 31, 2026Selin Bayramoğlu, George L Nemhauser, Nikolaos V SahinidisLearning to OptimizeBranch and Bound