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

DOI10.1007/978-3-031-46826-1_10MaRDI QIDQ6899202zbMATH OpenFDO

Authors Rosario Messana, Alberto Ceselli

Publication date 17 November 2025

Full work available at URL https://doi.org/10.1007/978-3-031-46826-1_10

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Mixed integer programming (90C11)

Cites work

• A primal-dual perspective of online learning algorithms
• Efficient algorithms for online decision problems
• Extracting certainty from uncertainty: regret bounded by variation in costs
• scientific article; zbMATH DE number 1746287 (Why is no real title available?)
• Importance weighting without importance weights: an efficient algorithm for combinatorial semi-bandits
• Online learning of facility locations
• Primal-dual subgradient methods for convex problems

This page was built for publication: Comparing ad-hoc and MIP-based algorithms for the online facility location problem

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