News
The proposed multiyear robust GEP methodology, as a tractable mixed integer linear programming optimization problem, copes with the inherent planning uncertainties associated with forecasted ...
By reformulating the linear multiplicative programming problem (LMP) as an equivalent nonconvex programming problem (EP), we present a new accelerating outcome space branch-and-bound algorithm for ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results