This is a preview. Log in through your library . Abstract We apply a potential reduction algorithm to solve the general linear complementarity problem (GLCP) minimize ...
Complexity theory is a fundamental branch of theoretical computer science that categorises computational problems according to their inherent difficulty and the resources required to solve them. At ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback