Skip to search formSkip to main contentSkip to account menuSemantic Scholar Semantic Scholar's Logo Search 206,509,296 papers from all fields of science

Search

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…

Highly Cited

2003

Highly Cited

2003

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

Highly Cited

1998

Highly Cited

1998

A stochastic branch and bound method for solving stochastic global optimization problems is proposed. As in the deterministic…

Highly Cited

1992

Highly Cited

1992

A new branch-and-bound algorithm for linear bilevel programming is proposed. Necessary optimality conditions expressed in terms…

Highly Cited

1992

Highly Cited

1992

In this paper a branch-and-bound procedure is described for scheduling the activities of a project of the PERT/CPM variety…

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…

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…

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…

Highly Cited

1975

Highly Cited

1975

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

Review

1966

Review

1966

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