Abstract: This paper addresses the distributed nonconvex optimization problem, where both the global cost function and local inequality constraint function are nonconvex. To tackle this issue, the ...
Explore zero-one integer programming, a key method in logical problem-solving, using binary choices for optimal decisions in finance, production, and more.
Abstract: Expensive constrained multi-objective optimization problems (ECMOPs) present a significant challenge to surrogate-assisted evolutionary algorithms (SAEAs) in effectively balancing ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback