Sorting weighted distances with applications to objective function evaluations in single facility location problems.

DOI10.1016/j.orl.2003.10.004zbMath1043.90044OpenAlexW1980722333MaRDI QIDQ1426729

Arie Tamir

Publication date: 15 March 2004

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2003.10.004

zbMATH Keywords

Facility locationOrdered-median objectiveWeighted distances

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Related Items

Efficient algorithms for the minmax regret path center problem with length constraint on trees, Minmax regret location--allocation problem on a network under uncertainty, Extensive facility location problems on networks: an updated review, An improved algorithm for the minmax regret path center problem on trees, A generalized model of equality measures in network location problems, An optimal algorithm for the weighted backup 2-center problem on a tree, Locating tree-shaped facilities using the ordered median objective, Range minimization problems in path-facility location on trees, Minimax regret path location on trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane
• Geometric complexity of some location problems
• Multicriteria planar location problems
• Improved bounds for planar \(k\)-sets and related problems
• Minimizing the sum of the \(k\) largest functions in linear time.
• Algorithmic results for ordered median problems
• On the computational power of pushdown automata
• An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs
• Multiobjective analysis of facility location decisions
• Taking a Walk in a Planar Arrangement
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• Constructing Arrangements of Lines and Hyperplanes with Applications
• On k-Hulls and Related Problems
• Linear Programming in Linear Time When the Dimension Is Fixed
• A generalized algorithm for centrality problems on trees
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• An $O(n\log ^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location Problems
• Optimal Search in Planar Subdivisions
• The single facility location problem with minimum distance constraints
• Dynamic Maintenance of Maxima of 2-d Point Sets
• Constructing Belts in Two-Dimensional Arrangements with Applications
• Finding kth paths and p-centers by generating and searching good data structures
• OPTIMAL FACILITY LOCATION UNDER VARIOUS DISTANCE FUNCTIONS
• The \(k\)-centrum multi-facility location problem