We also show that from our characterizations it is possible to obtain polynomial algorithms that guarantee O (log n)-approximation (hence optimal if P!=NP) for the minimization of both the ...
Abstract: Distribution network optimization is represented by non-convex power flow equations, where traditional convex relaxation methods may lead to inaccurate or infeasible solutions. To ...
Abstract: This article introduces a novel fault location method utilizing polynomial-chaos expansion (PCE) designed specifically for non-uniform transmission lines affected by uncertain parameters. It ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback