Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

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

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

Highly Cited

2003

Highly Cited

2003

A large number of real-world planning problems called combinatorial optimization problems share the following properties: They… Expand

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

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

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

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

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

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

Highly Cited

1975

Highly Cited

1975

This paper describes what is termed the “generalized assignment problem”. It is a generalization of the ordinary assignment… Expand

Review

1966

Review

1966

The essential features of the branch-and-bound approach to constrained optimization are described, and several specific… Expand