Algorithmic results for ordered median problems

Authors:
JöRg Kalcsics;Stefan Nickel;Justo Puerto;Arie Tamir
Affiliations:
Fraunhofer Institut für Techno- und Wirtschaftsmathematik, Kaiserslautern, Germany;Fraunhofer Institut für Techno- und Wirtschaftsmathematik, Kaiserslautern, Germany;Facultad de Matemáticas, Universidad de Sevilla, Spain;Department of Statistics & Operations Research, School of Mathematical Sciences, Tel Aviv, University, 69978 Ramat-Aviv, Israel
Venue:
Operations Research Letters
Year:
2002

Citing 9
Cited 16

Slowing down sorting networks to obtain faster sorting algorithms

Journal of the ACM (JACM)
Sorting in c log n parallel steps

Combinatorica
Finite dominating sets for network location problems

Operations Research
A linear algorithm for the pos/neg-weighted 1-median problem on a cactus

Computing
Applying Parallel Computation Algorithms in the Design of Serial Algorithms

Journal of the ACM (JACM)
On bisectors for different distance functions

Discrete Applied Mathematics - Special issue 14th European workshop on computational geometry CG'98 Selected papers
The k-centrum multi-faculty location problem

Discrete Applied Mathematics
Minimax parametric optimization problems and multi-dimensional parametric searching

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Aggregation Error Bounds for a Class of Location Models

Operations Research

Minimizing the sum of the k largest functions in linear time

Information Processing Letters
On k nearest points of a finite set in a normed linear space

Discrete Applied Mathematics
A generalized model of equality measures in network location problems

Computers and Operations Research
Convex ordered median problem with lp-norms

Computers and Operations Research
Minimax Regret Single-Facility Ordered Median Location Problems on Networks

INFORMS Journal on Computing
Simultaneous scheduling and location (ScheLoc): the planar ScheLoc makespan problem

Journal of Scheduling
Finding an Euclidean anti-k-centrum location of a set of points

Computers and Operations Research
Finite dominating sets for the multi-facility ordered median problem in networks and algorithmic applications

Computers and Industrial Engineering
Constructing a DC decomposition for ordered median problems

Journal of Global Optimization
The Ordered Gradual Covering Location Problem on a Network

Discrete Applied Mathematics
Placing and maintaining a core node in wireless ad hoc sensor networks

NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
An inverse approach to convex ordered median problems in trees

Journal of Combinatorial Optimization
On the exponential cardinality of FDS for the ordered p-median problem

Operations Research Letters
Sorting weighted distances with applications to objective function evaluations in single facility location problems

Operations Research Letters
Minimizing ordered weighted averaging of rational functions with applications to continuous location

Computers and Operations Research
Unreliable point facility location problems on networks

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In a recent series of papers a new type of objective function in location theory, called ordered median function, has been introduced and analyzed. This objective function unifies and generalizes most common objective functions used in location theory. In this paper we identify finite dominating sets for these models and develop polynomial time algorithms together with a detailed complexity analysis.