24 citations · 114 across the 29 of their papers we have counts for
4 papers · 1 filter
The Online Pause and Resume Problem: Optimal Algorithms and An Application to Carbon-Aware Load Shifting
Adam Lechowicz, Nicolas Christianson, Jinhang Zuo +4
We introduce and study the online pause and resume problem. In this problem, a player attempts to find the lowest (alternatively, highest) prices in a sequence of fixed length…
Data-driven Competitive Algorithms for Online Knapsack and Set Cover
Ali Zeynali, Bo Sun, Mohammad Hajiesmaili +1
The design of online algorithms has tended to focus on algorithms with worst-case guarantees, e.g., bounds on the competitive ratio. However, it is well-known that such algorithms…
Competitive Algorithms for the Online Multiple Knapsack Problem with Application to Electric Vehicle Charging
Bo Sun, Ali Zeynali, Tongxin Li +3
We introduce and study a general version of the fractional online knapsack problem with multiple knapsacks, heterogeneous constraints on which items can be assigned to which knapsa…
Online Inventory Management with Application to Energy Procurement in Data Centers
Lin Yang, Mohammad H. Hajiesmaili, Ramesh Sitaraman +3
Motivated by the application of energy storage management in electricity markets, this paper considers the problem of online linear programming with inventory management constraint…