Algorithmic results for ordered median problems

Operations Research Letters

Volumn 30, Issue 3, 2002, Pages 149-158

  Kalcsics, Jörg ^a   Nickel, Stefan ^a   Puerto, Justo ^b   Tamir, Arie ^c  

^a FRAUNHOFER INSTITUTE FOR INDUSTRIAL MATHEMATICS ITWM   (Germany)

^b UNIVERSITY OF SEVILLE   (Spain)

^c TEL AVIV UNIVERSITY   (Israel)

Author keywords

Algorithms; Complexity; Finite dominating sets; Location theory

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; POLYNOMIALS; SET THEORY;

ORDERED MEDIAN FUNCTIONS;

OPERATIONS RESEARCH;

EID: 0036600858     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(02)00121-9     Document Type: Article

References (26)

1. Sorting in c log n parallel steps
2. Optimal facility location under various distance functions
3. A linear algorithm for the pos/neg-weighted 1-median problem on a cactus
4. Maximizing concave functions in fixed dimension
5. Slowing down sorting networks to obtain faster algorithms
6. Convex location problems on tree networks
7. Aggregation error bounds for a class of location models
8. Finite dominating sets for network location problems
9. On bisectors for different distance functions
10. On the location of a tree-shaped facility
11. The rectilinear single facility location problem with minimum distance constraints
12. Applying parallel computation algorithms in the design of serial algorithms
13. An O(n log n) algorithm for the kth longest path in a tree with applications to location problems
14. Discrete ordered Weber problems
15. A unified approach to network location problems
16. Geometrical properties of the symmetrical single facility location problem
17. A flexible approach to location problems
18. Center to centroids in graphs
19. The k-centrum multi-facility location problem
20. Minimax parametric optimization problems in multi-dimensional parametric searching