Early Estimates of the Size of Branch-and-Bound Trees

DOI10.1287/ijoc.1040.0107zbMath1241.90090OpenAlexW2108334735MaRDI QIDQ2892274

Yanjun Li, Miroslav Karamanov, Cornuéjols, Gérard

Publication date: 18 June 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.1040.0107

zbMATH Keywords

computational complexitybranch-and-bound algorithminteger programminganalysis of algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items

\texttt{mplrs}: a scalable parallel vertex/facet enumeration code ⋮ SelfSplit parallelization for mixed-integer linear programming ⋮ On estimating workload in interval branch-and-bound global optimization algorithms ⋮ Estimating the Size of Branch-and-Bound Trees ⋮ On learning and branching: a survey ⋮ Could we use a million cores to solve an integer program? ⋮ From feasibility to improvement to proof: three phases of solving mixed-integer programs ⋮ Probabilistic prediction of the complexity of traveling salesman problems based on approximating the complexity distribution from experimental data ⋮ Assessing the performance of an optimization-based multilevel method

Uses Software

• ZRAM
• OR-Library