# Branch and bound

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2009

Highly Cited

2009

- IEEE Transactions on Pattern Analysis and Machineâ€¦
- 2009

Most successful object recognition systems rely on binary classification, deciding only if an object is present or not, but notâ€¦Â (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- 2003

Branch and bound algorithms are methods for global optimization in nonconvex problems [LW66, Moo91]. They are nonheuristic, inâ€¦Â (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- 2003

A large number of real-world planning problems called combinatorial optimization problems share the following properties: Theyâ€¦Â (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

- Operations Research
- 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

- SIAM Journal on Optimization
- 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

- Computers & OR
- 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

- SIAM Review
- 1991

An algorithm is described for solving large-scale instances of the Symmetric Traveling Salesman Problem (STSP) to optimality. Theâ€¦Â (More)

Is this relevant?

Highly Cited

1983

Highly Cited

1983

- IEEE Power Engineering Review
- 1983

A new approach is presented for solving the unit commitment problem based on branch-and-bound techniques. The method incorporatesâ€¦Â (More)

Is this relevant?

Highly Cited

1977

Highly Cited

1977

- IEEE Transactions on Computers
- 1977

A feature subset selection algorithm based on branch and bound techniques is developed to select the best subset of m featuresâ€¦Â (More)

Is this relevant?

Highly Cited

1975

Highly Cited

1975

- IEEE Transactions on Computers
- 1975

Computation of the k-nearest neighbors generally requires a large number of expensive distance computations. The method of branchâ€¦Â (More)

Is this relevant?