An efficient branch-and-bound algorithm for computing the best-subset regression models is proposed. The algorithm avoids the computation of the whole regression tree that generates all possible ...
This is a preview. Log in through your library . Abstract The generalized assignment problem examines the maximum profit assignments of jobs to agents such that each job is assigned to precisely one ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback