Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
Distributed constraint optimization (DCOP) problems are a popular way of formulating and solving agent-coordination problems. It… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Abstract.A variety of nonlinear, including semidefinite, relaxations have been developed in recent years for nonconvex… Expand
  • figure 2
  • figure 3
  • table 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
The second edition of this book is unique in that it focuses on methods for making formal statistical inference from all the… Expand
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1998
Highly Cited
1998
A stochastic branch and bound method for solving stochastic global optimization problems is proposed. As in the deterministic… Expand
  • table 5.1
  • table 5.2
Is this relevant?
Highly Cited
1992
Highly Cited
1992
A new branch-and-bound algorithm for linear bilevel programming is proposed. Necessary optimality conditions expressed in terms… Expand
  • figure 1
  • table 2
  • table 2
  • table 4
  • table 5
Is this relevant?
Highly Cited
1990
Highly Cited
1990
The bilevel programming problem is a static Stackelberg game in which two players try to maximize their individual objective… Expand
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… Expand
  • figure 1
  • table I
  • table VII
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… Expand
  • 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… Expand
  • figure 2
  • figure 1
  • figure 3
Is this relevant?