Semantic Scholar uses AI to extract papers important to this topic.
The second edition of this book is unique in that it focuses on methods for making formal statistical inference from all the… Expand A large number of real-world planning problems called combinatorial optimization problems share the following properties: They… Expand A stochastic branch and bound method for solving stochastic global optimization problems is proposed. As in the deterministic… Expand A new branch-and-bound algorithm for linear bilevel programming is proposed. Necessary optimality conditions expressed in terms… Expand The bilevel programming problem is a static Stackelberg game in which two players try to maximize their individual objective… Expand A new approach is presented for solving the unit commitment problem based on branch-and-bound techniques. The method incorporates… Expand A feature subset selection algorithm based on branch and bound techniques is developed to select the best subset of m features… Expand Computation of the k-nearest neighbors generally requires a large number of expensive distance computations. The method of branch… Expand This paper describes what is termed the “generalized assignment problem”. It is a generalization of the ordinary assignment… Expand The essential features of the branch-and-bound approach to constrained optimization are described, and several specific… Expand