Online facility location with facility movements

DOI10.1007/s10100-010-0153-8zbMath1213.90154OpenAlexW2006805721MaRDI QIDQ539473

Gabriella Divéki, Csanád Imreh

Publication date: 30 May 2011

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10100-010-0153-8

zbMATH Keywords

competitive analysisonline algorithmsfacility location

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Online algorithms; streaming algorithms (68W27)

Related Items (7)

Serving Online Requests with Mobile Servers ⋮ An online 2-dimensional clustering problem with variable sized clusters ⋮ Unnamed Item ⋮ Reallocating multiple facilities on the line ⋮ A new model for the linear 1-dimensional online clustering problem ⋮ Online facility location with mobile facilities ⋮ Facility reallocation on the line

Cites Work

• Unnamed Item
• A simple and deterministic competitive algorithm for online facility location
• A primal-dual algorithm for online non-uniform facility location
• A tree search algorithm for the p-median problem
• Improved complexity bounds for location problems on the real line
• On the competitive ratio for online facility location
• Incremental algorithms for facility location and \(k\)-median
• A Dual-Based Procedure for Uncapacitated Facility Location
• Profit-earning facility location
• Algorithm Theory - SWAT 2004
• Memoryless Facility Location in One Pass
• Approximation Algorithms for the k-Median Problem

This page was built for publication: Online facility location with facility movements