Improved complexity results for several multifacility location problems on trees
type: Item
instance of: scholarly article
title: Improved complexity results for several multifacility location problems on trees
zbMATH Open document ID: 1233.90212
author: Jörg Kalcsics
published in: Annals of Operations Research
publication date: 2012-03-09T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 6013346
zbMATH Keywords: multifacility location problems
zbMATH Keywords: dynamic programming
zbMATH Keywords: tree networks
zbMATH Keywords: ordered median problem
MaRDI profile type: Publication
full work available at URL: s10479-011-0905-4
OpenAlex ID: W1992072336
cites work: Slowing down sorting networks to obtain faster sorting algorithms
cites work: Improved complexity bounds for location problems on the real line
cites work: Algorithmic results for ordered median problems
cites work: Multifacility ordered median problems on networks: A further analysis
cites work: An Algorithmic Approach to Network Location Problems. I: Thep-Centers
cites work: An Algorithmic Approach to Network Location Problems. II: Thep-Medians
cites work: New Results on the Complexity of p-Centre Problems
cites work: Q4934873
cites work: Location Theory
cites work: Q4254943
cites work: On the exponential cardinality of FDS for the ordered \(p\)-median problem
cites work: An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs
cites work: The \(k\)-centrum multi-facility location problem
cites work: A polynomial algorithm for thep-centdian problem on a tree
DOI: 10.1007/S10479-011-0905-4
description: scientific article; zbMATH DE number 6013346