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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2003
Highly Cited
2003
In recent years, the problem of indexing mobile objects has assumed great importance because of its relevance to a wide variety… 
Highly Cited
2002
Highly Cited
2002
In this paper, we propose a way of exploiting Operations Research techniques within global constraints for cost-based domain… 
2000
2000
Introduces the subject of bus- and train-driver scheduling, and outlines a standard successful approach (TRACS II) using a blend… 
Review
1998
Review
1998
We investigate the Bayesian Information Criterion (BIC) for variable selection in models for censored survival data. Kass and… 
Highly Cited
1983
Highly Cited
1983
A ski for snowmobiles and the like comprising a ski runner and a keel member resiliently mounted at one end to the runner and…