An incremental algorithm for the uncapacitated facility location problem

DOI10.1002/NET.21595MaRDI QIDQ4565762zbMATH OpenOpenAlexFDO

Authors Ashwin Arulselvan, Olaf Maurer, Martin Skutella

Publication date 13 June 2018

Published in Networks (Search for Journal in Brave)

Full work available at URL https://strathprints.strath.ac.uk/55795/

zbMATH Keywords

competitive rationetwork designfacility location problemincremental algorithmrobust location

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Recommendations

• Incremental facility location problem and its competitive algorithms
• Algorithms – ESA 2004
• Incremental algorithms for facility location and \(k\)-median
• The multi-period incremental service facility location problem
• The incremental connected facility location problem

Cited in

(6)

• Dynamic evolution of economically preferred facilities
• Location problems with continuous demand and unreliable facilities: applications of families of incremental Voronoi diagrams
• A computational comparison of several formulations for the multi-period incremental service facility location problem
• The multi-period incremental service facility location problem
• An acceleration of Erlenkotter-Körkel's algorithms for the uncapacitated facility location problem
• The incremental connected facility location problem

This page was built for publication: An incremental algorithm for the uncapacitated facility location problem

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