Online Set Cover and Load Balancing are central problems in online optimization, and there is a long line of work on developing algorithms for these problems with convex objectives. Although we know ...
Abstract: The Capacitated Vehicle Routing Problems with Three-Dimensional Loading Constraints (3L-CVRPs) present significantly greater complexities when compared to the classical Capacitated Vehicle ...
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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback