The K-server problem via a modern optimization lens
Author(s)Bertsimas, Dimitris J; Jaillet, Patrick; Korolko, Nikita (Nikita E.)
MetadataShow full item record
We consider the well-known K-server problem from the perspective of mixed integer, robust and adaptive optimization. We propose a new tractable mixed integer linear formulation of the K-server problem that incorporates both information from the past and uncertainty about the future. By combining ideas from classical online algorithms developed in the computer science literature and robust and adaptive optimization developed in the operations research literature we propose a new method that (a) is computationally tractable, (b) almost always outperforms all other methods in numerical experiments, and (c) is stable with respect to potential errors in the assumptions about the future.
DepartmentSloan School of Management; Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science; Massachusetts Institute of Technology. Operations Research Center
European Journal of Operational Research
Bertsimas, Dimitris, Patrick Jaillet and Nikita Korolko. “The K-server problem via a modern optimization lens.” European Journal of Operational Research, 276, 1 (July 2019): © 2019 The Author(s)
Author's final manuscript