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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1966-2018
010020030019662018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2009
Highly Cited
2009
Most successful object recognition systems rely on binary classification, deciding only if an object is present or not, but not… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Branch and bound algorithms are methods for global optimization in nonconvex problems [LW66, Moo91]. They are nonheuristic, in… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
A large number of real-world planning problems called combinatorial optimization problems share the following properties: They… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1998
Highly Cited
1998
We discuss formulations of integer programs with a huge number of variables and their solution by column generation methods i e… (More)
Is this relevant?
Highly Cited
1998
Highly Cited
1998
The solution of convex Mixed Integer Quadratic Programming (MIQP) problems with a general branch{and{bound framework is… (More)
Is this relevant?
Highly Cited
1992
Highly Cited
1992
A method to solve the maximum clique problem based on an unconstmin~ quadratic zero-one programming fo~ulation is presented. A… (More)
Is this relevant?
Highly Cited
1991
Highly Cited
1991
An algorithm is described for solving large-scale instances of the Symmetric Traveling Salesman Problem (STSP) to optimality. The… (More)
  • figure 3
  • figure 4
  • figure 6
  • table 2
  • figure 7
Is this relevant?
Highly Cited
1983
Highly Cited
1983
A new approach is presented for solving the unit commitment problem based on branch-and-bound techniques. The method incorporates… (More)
  • figure 1
Is this relevant?
Highly Cited
1977
Highly Cited
1977
A feature subset selection algorithm based on branch and bound techniques is developed to select the best subset of m features… (More)
  • figure 1
  • figure 2
  • figure 3
  • table I
  • table II
Is this relevant?
Highly Cited
1975
Highly Cited
1975
Computation of the k-nearest neighbors generally requires a large number of expensive distance computations. The method of branch… (More)
  • figure 2
  • figure 1
  • figure 3
Is this relevant?