Online algorithms are central to solving resource allocation and matching challenges in dynamic environments where decisions must be made without complete knowledge of future events. Research in this ...

Bio-inspired computational methods have gained popularity recently. These methods mimic the seemingly complex behavior of ...

Part I of this paper presented a method for primal decomposition of large convex separable programs into a sequence of smaller subproblems. In this part, additional theory and development of a ...

Elzayn, Hadi, Shahin Jabbari, Christopher Jung, Michael J Kearns, Seth Neel, Aaron Leon Roth, and Zachary Schutzman. "Fair Algorithms for Learning in Allocation Problems." Proceedings of the ...

In this paper, the authors presented a Genetic Algorithm (GA) to solve the container storage problem in the port. This problem is studied with different container types such as regular, open side, ...