How Fast Can the Uniform Capacitated Facility Location Problem Be Solved on Path Graphs › Research Explorer

DOI

https://doi.org/10.1007/978-3-031-16500-9_25
Final published version

Alexander Ageev
Edward Gimadi
Alexandr Shtepa

Original language	English
Title of host publication	Analysis of Images, Social Networks and Texts - 10th International Conference, AIST 2021, Revised Selected Papers
Editors	Evgeny Burnaev, Sergei Ivanov, Alexander Panchenko, Dmitry I. Ignatov, Sergei O. Kuznetsov, Michael Khachay, Olessia Koltsova, Andrei Kutuzov, Natalia Loukachevitch, Amedeo Napoli, Panos M. Pardalos, Jari Saramäki, Andrey V. Savchenko, Evgenii Tsymbalov, Elena Tutubalina
Publisher	Springer Science and Business Media Deutschland GmbH
Pages	303-314
Number of pages	12
ISBN (Print)	9783031164996
DOIs	https://doi.org/10.1007/978-3-031-16500-9_25
Publication status	Published - 2022
Event	10th International Conference on Analysis of Images, Social Networks and Texts, AIST 2021 - Tbilisi, Georgia Duration: 16 Dec 2021 → 18 Dec 2021

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	13217 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	10th International Conference on Analysis of Images, Social Networks and Texts, AIST 2021
Country/Territory	Georgia
City	Tbilisi
Period	16.12.2021 → 18.12.2021

Research areas

Comparison analysis, Dynamic programming, Exact algorithm, Path graph, Polynomial algorithm, Pseudo-polynomial algorithm, Time complexity, Uniform Capacitated Facility Location Problem

OECD FOS+WOS

1.02 COMPUTER AND INFORMATION SCIENCES
1.01 MATHEMATICS

ID: 40000510