One-way and round-trip center location problems

Discrete Optimization

Volumn 2, Issue 2, 2005, Pages 168-184

  Tamir, Arie ^a   Halman, Nir ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Center location problems; Facility location; Tree networks

Indexed keywords

FUNCTIONS; GRAPH THEORY; LINEARIZATION; MATHEMATICAL MODELS; PACKAGING; POLYNOMIALS; PROBLEM SOLVING;

APPROXIMATION ALGORITHMS; CENTER LOCATION PROBLEMS; FACILITY LOCATION; TREE NETWORKS;

OPTIMIZATION;

EID: 22644444328     PISSN: 15725286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disopt.2004.12.004     Document Type: Article

References (44)

1. P.K. Agarwal, B. Aronov, M. Sharir, and S. Suri Selecting distances in the plane Algorithmica 9 1993 495 514
2. P.K. Agarwal, M. Sharir, and S. Toledo Applications of parametric searching in geometric optimization J. Algorithms 17 1994 292 318
3. A.A. Ageev Graphs, matrices and an elementary location problem Upravlyaemye Sistemy 29 1989 3 10 [83. 90B80 (90C10), MR1110574] (in Russian)
4. A.A. Ageev, Private Communication, 2004.
5. A.A. Ageev, and V.L. Beresnev Minimization algorithms for some classes of polynomials in Boolean variables Trudy Inst. Mat. 10 1988 5 17 (in Russian)
6. A.A. Ageev, and V.L. Beresnev Polynomially solvable cases of the simple plant location problem Proceedings of the First Conference on Integer Programming and Combinatorial Optimization (IPCO) Waterloo, Canada 1990 1 6
7. V.L. Beresnev, Algorithms for the minimization of polynomials from Boolean variables, Problemy Kibernet. 36 (1979) 225-246, 280 (Reviewer: C. Ilioi) [65K10 (90C09) MR0568455 (83k:65053)] (in Russian).
8. O. Berman, Z. Drezner, and G.O. Wesolowsky The collection depots location problem on networks Naval Res. Logist. 49 2002 15 24
9. R. Bhatia, S. Guha, S. Khuller, and Y.J. Sussmann Facility location with dynamic distance functions J. Combin. Optim. 2 1998 199 217
10. A. Chan, and R.L. Francis A round-trip location problem on a tree graph Transportation Sci. 10 1976 35 51
11. A. Chan, and D.W. Hearn A rectilinear distance round-trip location problem Transportation Sci. 11 1977 107 123
12. I.P. Chew, D. Dor, A. Efrat, and K. Kedem Geometric pattern matching in d-dimensional space Discrete Comput. Geom. 21 1999 257 274
13. I.P. Chew, K. Kedem, Improvements on geometric pattern matching problems, in: O. Nurmi, E. Ukkonen (Eds.), Scandinavian Workshop on Algorithm Theory-SWAT 1992, Lecture Notes in Computer Science, vol. 621, Springer, Berlin, July 1992, pp. 318-325.
14. R. Cole Slowing down sorting networks to obtain faster sorting algorithms J. Assoc. Comput. Mach. 34 1987 200 208
15. Z. Drezner, G. Steiner, and G.O. Wesolowsky One-facility location with rectilinear tour distances Naval Res. Logist. Quart. 32 1985 391 405
16. M. Dyer, A class of convex programs with applications to computational geometry, Technical Report, University of Leeds, 1991.
17. H. Edelsbrunner, L. Guibas, J. Pach, R. Pollack, R. Seidel, and M. Sharir Arrangements of curves in the plane-topology, combinatorics, and algorithms Theoret. Comput. Sci. 92 1992 319 336
18. G.N. Frederickson, and D.B. Johnson The complexity of selection and ranking in X + Y and matrices with sorted columns J. Comput. System Sci. 24 1982 197 208
19. F. Gavril Algorithms for minimum coloring, maximum clique, minimum covering by cliques and maximum independent set of a chordal graph SIAM J. Comput. 1 1971 180 187
20. M.C. Golumbic Algorithmic Graph Theory and Perfect Graphs 1980 Academic Press New York
21. D. Harel, and R.E. Tarjan Fast algorithms for finding nearest common ancestors SIAM J. Comput. 13 1984 338 355
22. J. Hershberger Finding the upper envelope of n line segments in O (n log n ) time Inform. Process. Lett. 33 1989 169 174
23. D.S. Hochbaum, and D.B. Shmoys A best possible approximation algorithm for the K-center problem Math. Oper. Res. 10 1985 180 184
24. D.S. Hochbaum, and D.B. Shmoys A unified approach to approximation algorithms for bottleneck problems J. Assoc. Comput. Mach. 33 1986 533 550
25. O. Kariv, and S.L. Hakimi An algorithmic approach to network location problems, Part 1: the p-centers SIAM J. Appl. Math. 37 1979 539 560
26. K. Kedem, R. Livne, J. Pach, and M. Sharir On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles Discrete Comput. Geom. 1 1986 59 71
27. S. Khuller, R. Pless, and Y.J. Sussmann Fault tolerant K-center problems Theoret. Comput. Sci. 242 2000 237 245
28. M.T. Ko, R.C. Lee, and J.S. Chang An optimal approximation algorithm for the rectilinear m-center problem Algorithmica 5 1990 341 352
29. A. Kolen The round trip p-center and covering problem on a tree Transportation Sci. 19 1985 222 234
30. A. Kolen, and A. Tamir Covering problems P.B. Mirchandani R.L. Francis Discrete Location Theory 1990 Wiley New York (Chapter 6)
31. N. Megiddo Combinatorial optimization with rational objective functions Math. Oper. Res. 4 1979 414 424
32. N. Megiddo Applying parallel computation algorithms in the design of serial algorithms J. Assoc. Comput. Mach. 30 1983 852 865
33. N. Megiddo Linear programming in linear time when the dimension is fixed J. Assoc. Comput. Mach. 31 1984 114 127
34. N. Megiddo, and A. Tamir New results on p-center problems SIAM J. Comput. 12 1983 751 758
35. N. Megiddo, A. Tamir, E. Zemel, and R. Chandrasekarn An O (n log 2 n ) algorithm for the kth longest path in a tree with applications to location problems SIAM J. Comput. 10 1981 328 337
36. M.H. Overmars, and C.-K. Yap New upper bounds in Klee's measure problem SIAM J. Comput. 20 1991 1034 1045
37. J. Plesnik A heuristic for the p-center problem in graphs Discrete Appl. Math. 17 1987 263 268
38. J. Plesnik Two heuristics for the absolute p-center problem in graphs Math. Slovaca 38 1988 227 233
39. D.J. Rose, R.E. Tarjan, and G.S. Lueker Algorithmic aspects of vertex elimination in graphs SIAM J. Comput. 5 1976 266 281
40. M. Sharir, and P.K. Agarwal Davenport-Schinzel Sequences and their Geometric Applications 1995 Cambridge University Press Cambridge
41. A. Tamir Improved complexity bounds for center location problems on networks by using dynamic data structures SIAM J. Discrete Math. 1 1988 377 396
42. A. Tamir An O (pn 2 ) algorithm for the p-median and related problems on tree graphs Oper. Res. Lett. 19 1996 59 64
43. Q. Wang, and K.H. Cheng A heuristic for the k-center problem with costs and usage weights Proceedings of the 28th Annual Allerton Conference on Communication, Control, and Computing 1990 324 333
44. E. Zemel An O (n ) algorithm for the linear multiple choice problem and related problems Inform. Process. Lett. 18 1984 123 128