Minimizing the sum of the k largest functions in linear time

Information Processing Letters

Volumn 85, Issue 3, 2003, Pages 117-122

  Ogryczak, Wlodzimierz ^a   Tamir, Arie ^b  

^a WARSAW UNIVERSITY OF TECHNOLOGY   (Poland)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Algorithms; Computational geometry; k centrum; k largest; Location; Rectilinear

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; FUNCTIONS; OPTIMIZATION; SET THEORY;

LINEAR FUNCTIONS;

LINEAR PROGRAMMING;

EID: 0037435797     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(02)00370-8     Document Type: Article

References (24)

1. Andreatta G., Mason F.M. k-eccentricity and absolute k-centrum of a tree. European J. Oper. Res. 19:1985;114-117.
2. Andreatta G., Mason F.M. Properties of the k-centrum in a network. Networks. 15:1985;21-25.
3. Cohen E., Megiddo N. Maximizing concave functions in fixed dimension. Pardalos P.M. Complexity in Numerical Optimization. 1993;74-87 World Scientific, Singapore.
4. Francis R.L., Lowe T.J., Tamir A. Aggregation error bounds for a class of location models. Oper. Res. 48:2000;294-307.
5. Hakimi S.L. Optimum locations of switching centers and the absolute centers and medians of a graph. Oper. Res. 12:1964;450-469.
6. Hakimi S.L. Optimum distribution of switching centers in a communication network and some related graph-theoretic problems. Oper. Res. 13:1965;462-475.
7. Halpern J. The location of a cent-dian convex combination on an undirected tree. J. Regional Sci. 16:1976;237-245.
8. Halpern J. Finding minimal center-median convex combination (cent-dian) of a graph. Management Sci. 24:1978;535-544.
9. Halpern J. Duality in the cent-dian of a graph. Oper. Res. 28:1980;722-735.
10. Handler G.Y. Medi-centers of a tree. Transportation Sci. 19:1985;246-260.
11. Kalcsics J., Nickel S., Puerto J., Tamir A. Algorithmic results for ordered median problems. Oper. Res. Lett. 30:2002;149-158.
12. Megiddo N. Linear programming in linear time when the dimension is fixed. J. ACM. 31:1984;114-127.
13. Megiddo N., Tamir A. Linear time algorithms for some separable quadratic programming problems. Oper. Res. Lett. 13:1993;203-211.
14. Nickel S., Puerto J. A unified approach to network location problems. Networks. 34:1999;283-290.
15. Ogryczak W. On the lexicographic minimax approach to location-allocation problems, Discussion Paper IS-MG 94/22. 1994;Institute de Statistique, Mathematiques de la Gestion, Universite Libre de Bruxelles.
16. Ogryczak W. Inequality measures and equitable approaches to location problems. European J. Oper. Res. 122:2000;374-391.
17. Puerto J., Fernandez F.R. The symmetrical single facility location problem, Technical Report, Prepublicacion de la Facultad de Matematicas. 1995;Universidad de Sevilla.
18. Slater P.J. Centers to centroids in a graph. J. Graph Theory. 2:1978;209-222.
19. Tamir A. The k-centrum multi-facility location problem. Discrete Appl. Math. 109:2001;293-307.
20. Tamir A., Perez-Brito D., Moreno-Perez J.A. A polynomial algorithm for the p-centdian problem on a tree. Networks. 32:1998;255-262.
21. Tardos E. A strongly polynomial algorithm to solve combinatorial linear programs. Oper. Res. 34:1986;250-256.
22. Tokuyama T. Minimax parametric optimization problems in multi-dimensional parametric searching. Proc. 33rd Annual ACM Symposium on Theory of Computing. 2001;75-84.
23. Yager R.R. On ordered weighted averaging aggregation operators in multicriteria decision making. IEEE Trans. Systems, Man Cybernet. 18:1988;183-190.
24. Zemel E. An O(n) algorithm for the linear multiple choice knapsack problem and related problems. Inform. Process. Lett. 18:1984;123-128.