Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,118,878 papers from all fields of science
Search
Sign In
Create Free Account
Branch and bound
Known as:
Branch and bound algorithm
, Branch-and-bound
, BB
Expand
Branch and bound (BB, B&B, or BnB) is an algorithm design paradigm for discrete and combinatorial optimization problems, as well as general real…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Algorithm
Alpha–beta pruning
Backtracking
Best-first search
Expand
Broader (1)
Combinatorial optimization
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2005
Highly Cited
2005
Earliness-tardiness scheduling with setup considerations
F. Sourd
Computers & Operations Research
2005
Corpus ID: 2403485
Highly Cited
2003
Highly Cited
2003
A neural network algorithm for the traveling salesman problem with backhauls
H. Ghaziri
,
I. Osman
2003
Corpus ID: 14852652
Highly Cited
2003
Highly Cited
2003
On nearest neighbor indexing of nonlinear trajectories
C. Aggarwal
,
D. Agrawal
ACM SIGACT-SIGMOD-SIGART Symposium on Principles…
2003
Corpus ID: 14060994
In recent years, the problem of indexing mobile objects has assumed great importance because of its relevance to a wide variety…
Expand
Highly Cited
2002
Highly Cited
2002
Optimization-Oriented Global Constraints
Filippo Focacci
,
Andrea Lodi
,
M. Milano
Constraints
2002
Corpus ID: 23950098
In this paper, we propose a way of exploiting Operations Research techniques within global constraints for cost-based domain…
Expand
2001
2001
Single machine weighted earliness-tardiness penalty problem with a common due date
Sakib A. Mondal
,
A. K. Sen
Computers & Operations Research
2001
Corpus ID: 33590581
Highly Cited
1999
Highly Cited
1999
A system for the design of short term harvesting strategy
R. Epstein
,
Enrique Nieto
,
A. Weintraub
,
P. Chevalier
,
J. Gabarro
European Journal of Operational Research
1999
Corpus ID: 8654864
1998
1998
Availability based spare optimization using renewal process
U. Kumar
,
J. Knezevic
1998
Corpus ID: 61524862
Highly Cited
1994
Highly Cited
1994
Fast Parzen Density Estimation Using Clustering-Based Branch and Bound
B. Jeon
,
D. Landgrebe
IEEE Transactions on Pattern Analysis and Machine…
1994
Corpus ID: 8340239
This correspondence proposes a fast Parzen density estimation algorithm that would be especially useful in nonparametric…
Expand
Highly Cited
1983
Highly Cited
1983
Scheduling a Single Machine to Minimize the Weighted Number of Tardy Jobs
Francisco J. Villarreal
,
R. Bulfin
1983
Corpus ID: 60721043
A ski for snowmobiles and the like comprising a ski runner and a keel member resiliently mounted at one end to the runner and…
Expand
1976
1976
An integer programming formulation of computer data base design problems
J. Hoffer
Information Sciences
1976
Corpus ID: 30978345
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)
ACCEPT & CONTINUE