Theoretical comparisons of search strategies in branch-and-bound algorithms

Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99) Algorithms in computer science (68W99) Mathematical programming (90C99)

Cites Work

Algorithms for Scheduling Independent Tasks
Branch-and-Bound Methods: A Survey
Branch-and-Bound Methods: General Formulation and Properties
Backtrack Programming
Experiments in mixed-integer linear programming
Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems
Discrete Programming by the Filter Method
A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
Letter to the Editor—A Note on the Branch-and-Bound Principle
Integer Programming by Implicit Enumeration and Balas’ Method
Practical Solution of Large Mixed Integer Programming Problems with Umpire
Title not available (Why is that?)

Cited In (21)

Using branch-and-bound algorithms to obtain suboptimal solutions
Parallel best-first branch-and-bound in discrete optimization: a framework
Towards an abstract parallel branch and bound machine
Performances of parallel branch and bound algorithms with best-first search
A note on anomalies in parallel branch-and-bound algorithms with one-to- one bounding functions
Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints
Optimization of template-driven scheduling mechanisms: Regularity measures and computational techniques
Strategies of node selection in search procedures for solving combinatorial optimization problems: A survey and a general formalization
An extremal problem on random trees
Pareto optimality and robustness in bi-blending problems
An effective structured approach to finding optimal partitions of networks
Depth-m search in branch-and-bound algorithms
The stochastic transportation problem with single sourcing
The semi-continuous quadratic mixture design problem: description and branch-and-bound approach
Some new perspectives for solving 0--1 integer programming problems using balas method
An upper bound for the speedup of parallel best-bound branch-and-bound algorithms
A new node selection strategy in the branch-and-bound procedure
Probability modeling of branch-and-bound method
On a branch-and-bound approach for a Huff-like Stackelberg location problem
Discrete optimization methods for multiprocessor computer systems
Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning

This page was built for publication: Theoretical comparisons of search strategies in branch-and-bound algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4192964)