Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning

DOI10.1016/j.disopt.2016.01.005zbMath1387.90010OpenAlexW2277678953MaRDI QIDQ1751150

David R. Morrison, Edward C. Sewell, Jason J. Sauppe, Jacobson, Sheldon H.

Publication date: 24 May 2018

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2016.01.005

zbMATH Keywords

survey integer programming branch-and-bound discrete optimization search strategies cyclic best first search

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items

Heuristic methods for minimum-cost pipeline network design -- a node valency transfer metaheuristic, A comparative study on recently-introduced nature-based global optimization methods in complex mechanical system design, Boundedness and nuclearity of pseudo-differential operators on homogeneous trees, Unnamed Item, Multivariable Branching: A 0-1 Knapsack Problem Case Study, Mixed-Integer Convex Nonlinear Optimization with Gradient-Boosted Trees Embedded, Branch-and-Bound for Biobjective Mixed-Integer Linear Programming, An exact branch-and-price approach for the medical student scheduling problem, A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling: a mixed graph coloring approach, Exact bidirectional algorithm for the least expected travel-time path problem on stochastic and time-dependent networks, Decomposition Branching for Mixed Integer Programming, Computational study of a branching algorithm for the maximum \(k\)-cut problem, Norm-optimal iterative learning control in an integer-valued control domain, Grouped variable selection with discrete optimization: computational and statistical perspectives, An integer linear programming approach to solving the Eternity puzzle, A nearly optimal randomized algorithm for explorable heap selection, Solving larger maximum clique problems using parallel quantum annealing, Directed Community Detection With Network Embedding, Pilot pattern design scheme with branch and bound in PSA-OFDM system, A state-of-the-art survey on multi-scenario scheduling, Optimal \((0, 1)\)-matrix completion with majorization ordered objectives, Achieving consistency with cutting planes, Airline capacity distribution under financial budget and resource consideration, A branch and bound algorithm for robust binary optimization with budget uncertainty, Computational advances in polynomial optimization: RAPOSa, a freely available global solver, Domain reduction techniques for global NLP and MINLP optimization, Stochastic global optimization algorithms: a systematic formal approach, A branch and price algorithm for EOS constellation imaging and downloading integrated scheduling problem, A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching, Parallelization of a branch-and-bound algorithm for the maximum weight clique problem, Optimal design of experiments for estimating the time of death in forensic medicine, Preprocessing and cut generation techniques for multi-objective binary programming, Tighter McCormick relaxations through subgradient propagation, \textit{Branch} \& \textit{Memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees, An SOCP relaxation based branch-and-bound method for generalized trust-region subproblem, Some new perspectives for solving 0--1 integer programming problems using balas method, Non-probabilistic interval model-based system reliability assessment for composite laminates, A maximum edge-weight clique extraction algorithm based on branch-and-bound, A Bilevel Approach for Identifying the Worst Contingencies for Nonconvex Alternating Current Power Systems, Packing-based branch-and-bound for discrete malleable task scheduling, The effect of periodic disturbance patterns on the efficiency of active flow control in a linear stator cascade, A comparison of optimal, binary closed-loop active flow control applied to an annular compressor stator cascade with periodic disturbances, TCMI: a non-parametric mutual-dependence estimator for multivariate continuous distributions, Decomposition of loosely coupled integer programs: a multiobjective perspective, A new mathematical model for tiling finite regions of the plane with polyominoes, Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems, Computational Short Cuts in Infinite Domain Constraint Satisfaction, The Study of Depot Position Effect on Travel Distance in Order Picking Problem, Optimal monomial quadratization for ODE systems

Uses Software

Cites Work