Improved algorithms for several network location problems with equality measures.
type: Item
instance of: scholarly article
title: Improved algorithms for several network location problems with equality measures.
zbMATH Open document ID: 1033.90011
DOI: 10.1016/S0166-218X(02)00599-1
author: Juan A. Mesa
author: Justo Puerto
author: Arie Tamir
published in: Discrete Applied Mathematics
publication date: 2003-09-22T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 90B80
zbMATH DE Number: 1984623
zbMATH Keywords: Network location
zbMATH Keywords: Equality measures
zbMATH Keywords: Algorithms
Wikidata QID: Q58217317
MaRDI profile type: Publication
cites work: Generalized concavity
cites work: Mean-Variance Location Problems
cites work: Equity Maximizing Facility Location Schemes
cites work: Center problems with pos/neg weights on trees
cites work: Slowing down sorting networks to obtain faster sorting algorithms
cites work: Q4229613
cites work: The complexity of selection and ranking in X+Y and matrices with sorted columns
cites work: An algorithm for the minimum variance point of a network
cites work: Off-Line Maintenance of Planar Configurations
cites work: Locating a Point of Minimum Variance on Triangular Graphs
cites work: A note on locating a central vertex of a 3-cactus graph
cites work: Q4254946
cites work: Heuristics for multiple facility location in a network using the variance criterion
cites work: The Variance Location Problem on a Network with Continuously distributed demand
cites work: The maximum absolute deviation measure in location problems on networks
cites work: An algorithm for the Lorenz measure in locational decisions on trees
cites work: Equity measurement in facility location analysis: A review and framework
cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
cites work: New Results on the Complexity of p-Centre Problems
cites work: An $O(n\log ^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location Problems
cites work: Technical Note—On the Complexity of Some Classes of Location Problems
cites work: An O(n) algorithm for the linear multiple choice knapsack problem and related problems
DBLP publication ID: journals/dam/MesaPT03
description: scientific article; zbMATH DE number 1984623