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
2014
Highly Cited
2014
Dynamic power management in energy-aware computer networks and data intensive computing systems
2011
2011
Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm
We propose an algorithm for constrained global optimization to tackle non-convex nonlinear multivariate polynomial programming… 
2003
2003
Optimal grouping algorithm for a group decision feedback detector in synchronous CDMA communications
The group decision feedback (GDF) detector is studied in this letter. Given the maximum group size, a grouping algorithm is… 
Highly Cited
2003
Highly Cited
2003
On nearest neighbor indexing of nonlinear trajectories
In recent years, the problem of indexing mobile objects has assumed great importance because of its relevance to a wide variety… 
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
Review
1998
Review
1998
Bayesian Information Criterion for Censored Survival Models 1
We investigate the Bayesian Information Criterion (BIC) for variable selection in models for censored survival data. Kass and… 
Highly Cited
1983
Highly Cited
1983
Scheduling a Single Machine to Minimize the Weighted Number of Tardy Jobs
A ski for snowmobiles and the like comprising a ski runner and a keel member resiliently mounted at one end to the runner and… 
1980
1980
Branch and bound experiments in nonlinear integer programming
The branch and bound principle has been established as an effective computational tool for solving linear integer programming… 
1976
1976
An integer programming formulation of computer data base design 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)