Skip to search formSkip to main contentSkip to account menu

Branch and bound

Known as: Branch and bound algorithm, Branch-and-bound, BB 
Branch and bound (BB, B&B, or BnB) is an algorithm design paradigm for discrete and combinatorial optimization problems, as well as general real… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
AlgorithmAlpha–beta pruningBacktrackingBest-first search

Broader (1)

Combinatorial optimization

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
An efficient hybrid self-learning method for stochastic cellular manufacturing problem: A queuing-based analysis
Highly Cited
2010
Highly Cited
2010
The train driver recovery problem - A set partitioning based model and solution method
2010
2010
‘Love it. Buy it. Sell it’
Our work adds to existing research on eBay by presenting it as a space where consumers’ imaginations are stimulated and where… 
Highly Cited
2005
Highly Cited
2005
Earliness-tardiness scheduling with setup considerations
Highly Cited
2004
Highly Cited
2004
Global solution of semi-infinite programs
2001
2001
Single machine weighted earliness-tardiness penalty problem with a common due date
Highly Cited
1999
Highly Cited
1999
A system for the design of short term harvesting strategy
Highly Cited
1994
Highly Cited
1994
Fast Parzen Density Estimation Using Clustering-Based Branch and Bound
This correspondence proposes a fast Parzen density estimation algorithm that would be especially useful in nonparametric… 
Highly Cited
1983
Highly Cited
1983
An algorithm for optimal two-dimensional compaction of VLSI layouts
Highly Cited
1979
Highly Cited
1979
An approach for solving a class of transportation scheduling problems
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)