The \(K\)-server problem via a modern optimization lens

DOI10.1016/j.ejor.2018.12.044zbMath1430.90245OpenAlexW2907837908WikidataQ120697917 ScholiaQ120697917MaRDI QIDQ1728474

Nikita Korolko, Patrick Jaillet, Dimitris J. Bertsimas

Publication date: 25 February 2019

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2018.12.044

zbMATH Keywords

schedulingwork function algorithmadaptive robust optimization

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)

Uses Software

• Julia

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A fast work function algorithm for solving the \(k\)-server problem
• The \(k\)-server problem
• Distributionally robust multi-item newsvendor problems with multimodal demand distributions
• Tractable stochastic analysis in high dimensions via robust optimization
• Selected topics in robust convex optimization
• Competitive group testing
• Adjustable robust solutions of uncertain linear programs
• Data-driven robust optimization
• Theory and Applications of Robust Optimization
• New Ressults on Server Problems
• Computing in Operations Research Using Julia
• Competitive algorithms for server problems
• An optimal on-line algorithm for metrical task system
• On the k -server conjecture
• Traversing Layered Graphs Using the Work Function Algorithm
• The harmonic k -server algorithm is competitive