This note proposes an algorithm to solve a least squares problem when the parameters are restricted to be nonnegative. The algorithm does not use linear programming but utilizes the normal equations ...
The "branch-and-bound" algorithm for the exact solution of a three-machine scheduling problem proposed by Lomnicki has been generalized to the case of an arbitrary number of machines (under the ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback