The K-server problem via a modern optimization lens
Name
k_server-ejor.pdf
Description
Accepted version
Size
602.93 KB
Format
Adobe PDF
Checksum (MD5)
8cbba2bd53999de919ca7e82373d3ba1
Author(s)
Bertsimas, Dimitris J
Jaillet, Patrick
Korolko, Nikita (Nikita E.)
Date Issued
July 2019
Journal
European Journal of Operational Research
Publisher
Elsevier BV
Citation
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)
Version
Author's final manuscript
Abstract
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.
MIT Department
Sloan School of Management
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Operations Research Center
Terms of Use
Creative Commons Attribution-NonCommercial-NoDerivs License
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1016/J.EJOR.2018.12.044
