Online learning of facility locations

MaRDI QIDQ7028607zbMATH OpenFDO

Authors Stephen Pasteris, Ting He, Fabio Vitale, Shi-Qiang Wang, Mark Herbster

Publication date 11 February 2025

Full work available at URL https://proceedings.mlr.press/v132/pasteris21a.html

zbMATH Keywords

facility location problemmachine learningonline optimisation

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Online algorithms; streaming algorithms (68W27) Discrete location and assignment (90B80)

Cites work

• A Greedy Heuristic for the Set-Covering Problem
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• Combinatorial online prediction via metarounding
• Exponentiated gradient versus gradient descent for linear predictors
• scientific article; zbMATH DE number 4202014 (Why is no real title available?)
• scientific article; zbMATH DE number 1303608 (Why is no real title available?)
• scientific article; zbMATH DE number 1559542 (Why is no real title available?)
• Online non-convex learning: following the perturbed leader is optimal
• Playing Games with Approximation Algorithms
• Some aspects of the sequential design of experiments
• The Nonstochastic Multiarmed Bandit Problem

Cited in

(1)

• Comparing ad-hoc and MIP-based algorithms for the online facility location problem

This page was built for publication: Online learning of facility locations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7028607)