@inproceedings{0b824f8567634655b147abecb2ce1fc6,
title = "Time complexity of the ageev{\textquoteright}s algorithm to solve the uniform hard capacities facility location problem",
abstract = "We show that the facility location problem with uniform hard capacities can be solved by the Ageev{\textquoteright}s algorithm in O(m3n2) time, where m is the number of facilities and n is the number of clients. This improves the results O(m5n2) of Ageev in 2004 and O(m4n2) of Ageev, Gimadi, and Kurochkin in 2009.",
keywords = "Capacitated, Dynamic programming technique, Exact algorithm, Facility location problem, Network, Path graph, Polynomial, Time complexity, Uniform",
author = "Gimadi, {Edward Kh} and Kurochkina, {Anna A.}",
year = "2019",
month = jan,
day = "1",
doi = "10.1007/978-3-030-10934-9_9",
language = "English",
isbn = "9783030109332",
series = "Communications in Computer and Information Science",
publisher = "Springer-Verlag GmbH and Co. KG",
pages = "123--130",
editor = "Yury Kochetov and Michael Khachay and Yury Evtushenko and Vlasta Malkova and Mikhail Posypkin and Milojica Jacimovic",
booktitle = "Optimization and Applications - 9th International Conference, OPTIMA 2018, Revised Selected Papers",
address = "Germany",
note = "9th International Conference on Optimization and Applications, OPTIMA 2018 ; Conference date: 01-10-2018 Through 05-10-2018",
}