Improved algorithms for several network location problems with equality measures

Discrete Applied Mathematics

Volumn 130, Issue 3, 2003, Pages 437-448

  Mesa, Juan A ^a   Puerto, Justo ^a   Tamir, Arie ^b  

^a UNIVERSITY OF SEVILLE   (Spain)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Algorithms; Equality measures; Network location

Indexed keywords

ALGORITHMS; LOCATION; MATHEMATICAL MODELS; TREES (MATHEMATICS);

EQUALITY MEASURES;

PROBLEM SOLVING;

EID: 0042889549     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(02)00599-1     Document Type: Article

References (29)

1. Avriel M., Diewart W.E., Schaible S., Zang I. Generalized Concavity. 1988;Plenum, New York.
2. Berman O. Mean-variance location problems. Transp. Sci. 24:1990;287-293.
3. Berman O., Kaplan E.H. Equity maximizing facility location schemes. Transp. Sci. 24:1990;137-144.
4. Burkard R.E., Dollani H. Center problems with Pos/Neg weights on trees. European J. Oper. Res. 145:2003;483-495.
5. Cole R. Slowing down sorting networks to obtain faster sorting algorithms. J. ACM. 34:1987;200-208.
6. Eiselt H.A., Laporte G. Objectives in location problems. Drezner Z. Facility Location: A Survey of Applications and Methods. 1995;151-180 Springer, Berlin.
7. Erkut E. Inequality measures for location problems. Location Sci. 1:1993;199-217.
8. Frederickson G.N., Johnson D.B. The complexity of selection and ranking in. X+Y and matrices with sorted columns J. Comput. System Sci. 24:1982;97-208.
9. Halpern J., Maimon O. Accord and conflict among several objectives in locational decisions on tree networks. Thisse J.F., Zoller H.G. Locational Analysis of Public Facilities. 1983;301-314 North-Holland, Amsterdam.
10. Hansen P., Zheng M. An algorithm for the minimum variance point of a network. RAIRO Rech. Opér./Oper. Res. 25:1991;119-126.
11. P. Hansen, M. Zheng, private communication, January 2002.
12. Hershberger J., Suri S. Off-line maintenance of planar configurations. J. Algorithms. 21:1996;453-475.
13. Kincaid R.K., Maimon O. Locating a point of minimum variance on triangular graphs. Transp. Sci. 23:1989;216-219.
14. Kincaid R.K., Maimon O. A note on locating a central vertex of a 3-cactus graph. Comput. Oper. Res. 17:1990;315-320.
15. López-de-los-Mozos M.C., Mesa J.A. The 2-variance location problem in a tree network. Stud. Locational Anal. 11:1997;73-87.
16. López-de-los-Mozos M.C., Mesa J.A. Heuristics for multiple facility location in a network using the variance criterion. J. Oper. Res. Soc. 51:2000;971-981.
17. López-de-los-Mozos M.C., Mesa J.A. The variance location problem on a network with continuously distributed demand. RAIRO Oper. Res. 34:2000;155-181.
18. López-de-los-Mozos M.C., Mesa J.A. The maximum absolute deviation measure in location problems on networks. European J. Oper. Res. 135:2001;184-194.
19. M.C. López-de-los-Mozos, J.A. Mesa, The sum of weighted absolute differences location problem, 2001, submitted for publication.
20. Maimon O. The variance equity measure in locational decision theory. Ann. Oper. Res. 6:1986;147-160.
21. Maimon O. An algorithm for the Lorenz measure in locational decisions on trees. J. Algorithms. 9:1988;583-596.
22. Marsh M.T., Schilling D.A. Equity measurement in facility location analysis. a review and framework European J. Oper. Res. 74:1994;1-17.
23. 3 and related problems SIAM J. Comput. 12:1983;759-776.
24. Megiddo N., Tamir A. New results on the complexity of. p -center problems SIAM J. Comput. 12:1983;751-758.
25. 2 n) algorithm for the k th longest path in a tree with applications to location problems SIAM J. Comput. 10:1981;328-337.
26. Mulligan G.F. Equality measures and facility location. Papers Regional Sci. 70:1991;345-365.
27. Savas E.S. On equity in providing public services. Manage. Sci. 24:1978;800-808.
28. Tamir A. On the complexity of some classes of location problems. Transp. Sci. 26:1992;352-354.
29. Zemel E. An. O(n) algorithm for the linear multiple choice knapsack problem and related problems Inform. Process. Lett. 18:1984;123-128.