Estimating the Size of Branch-and-Bound Trees
From MaRDI portal
Publication:5085999
DOI10.1287/ijoc.2021.1103OpenAlexW3087527810MaRDI QIDQ5085999
Pierre Le Bodic, Gregor Hendel, Marc E. Pfetsch, Daniel M. Anderson
Publication date: 30 June 2022
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2021.1103
Related Items
On the complexity of finding shortest variable disjunction branch-and-bound proofs, Transferring information across restarts in MIP, Adaptive solution prediction for combinatorial optimization
Uses Software
Cites Work
- Unnamed Item
- Greedy function approximation: A gradient boosting machine.
- Forecasting with exponential smoothing. The state space approach
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- How important are branching decisions: fooling MIP solvers
- Learning MILP resolution outcomes before reaching time-limit
- MIPLIB 2003
- Early Estimates of the Size of Branch-and-Bound Trees
- Predicting the Solution Time of Branch-and-Bound Algorithms for Mixed-Integer Programs
- An Automatic Method of Solving Discrete Programming Problems
- Mixed Integer Programming Computation
- Branch-and-Cut for the Maximum Feasible Subsystem Problem
- Heuristic Sampling: A Method for Predicting the Performance of Tree Searching Programs
- Estimating the Efficiency of Backtrack Programs
- Vertex packings: Structural properties and algorithms
- On the integer-valued variables in the linear vertex packing problem
- Tree Size by Partial Backtracking
- Properties of vertex packing and independence system polyhedra
- A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
- Mixed Integer Programming: Analyzing 12 Years of Progress
- Linear-Time FPT Algorithms via Network Flow
- A tree-search algorithm for mixed integer programming problems
- A Machine Learning-Based Approximation of Strong Branching
- Random forests
