Restricted center problems under polyhedral gauges

European Journal of Operational Research

Volumn 104, Issue 2, 1998, Pages 343-357

  Nickel, Stefan ^a  

^a Rheinland Pfälzische Technische Universität Kaiserslautern Landau   (Germany)

Author keywords

Computational analysis; Geometric programming; Global optimization; Location

Indexed keywords

ALGORITHMS; CLASSIFICATION (OF INFORMATION); COMBINATORIAL MATHEMATICS; COMPUTATIONAL GEOMETRY; LOCATION; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING;

COMPUTATIONAL ANALYSIS; GEOMETRIC PROGRAMMING; POLYHEDRAL GAUGES; RESTRICTED CENTER PROBLEMS;

MATHEMATICAL PROGRAMMING;

EID: 0031673183     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(97)00189-6     Document Type: Article

References (28)

1. R.L. Francis, L.F. McGinnis Jr., J.A. White. Facility Layout and Location: An Analytical Approach, 2nd edition, Prentice-Hall, Englewood Cliffs, NJ, 1992.
2. R.F. Love, J.G. Morris, G.O. Wesolowsky, Facilities Location: Models &Methods, North-Holland, Amsterdam, 1988.
3. F. Plastria, Continuous location problems, in: Z. Drezner (Ed.), Facility Location, Springer, Berlin, 1995.
4. p distance minimax location, SIAM J. Algebraic Discrete Methods, 1 (1980) 315-321.
5. B. Pelegrin. A general approach to the 1-center problem. Cahiers du C.E.R.O., 28 (1986) 293-301.
6. H.W. Harnacher, Mathematische Lösungverfahren für planare Standortprobleme, Vieweg, Braunschweig, 1995.
7. H.W. Harnacher, S. Nickel, Multicriteria planar location problems, European J. Oper. Res., 94 (1996) 66-86.
8. H.W. Harnacher, S. Nickel, A. Schneider, Classification of location problems. Technical Report, Department of Mathematics, University of Kaiserslautern, 1996 (Submitted to Location Sci.).
9. S. Nickel, Discretization of Planar Location Problems, Shaker, Aachen, 1995.
10. E. Carrizosa, E. Condo, M. Munoz, J. Puerto, The generalized weber problem with expected distances, RAIRO, 29 (1994) 35-57.
11. Y.P. Aneja, M. Parlar, Algorithms for weber facility location in the presence of forbidden regions and/or barriers to travel, Transportation Sci., 28 (1994) 70-76.
12. H.W. Hamacher, S. Nickel, Combinatorial algorithms for some 1-facility median problems in the plane, European J. Oper. Res., 79 (1994) 340-351.
13. H.W. Hamacher, S. Nickel, Restricted planar location problems and applications, Naval Res. Logist., 42 (1995) 967-992.
14. R.C. Larson, G. Sadiq, Facility locations with the manhattan metric in the presence of barriers to travel, Oper. Res., 31 (1983) 652-669.
15. S. Nickel, Restriktive Standortprobleme, Diploma Thesis, Fachbereich Mathematik, University of Kaiserslautern, 1991.
16. P. Hansen, D. Peeters, J.F. Thisse, An algorithm for a constrained weber problem, Management Sci., 28 (1982) 1285-1295.
17. R. Mifflin, On superlinear convergence in univariate nonsmooth optimization, Math. Programming, 49 (1991) 273-279.
18. A. Brockmann, Lösungen von restriktiven Standortproblemen durch Randsuche, Diploma Thesis, Fachbereich Mathematik, University of Kaiserslautern, 1995.
19. H. Minkowski, Gesammelte Abhandlungen, Band 2, Chelsea, New York, 1967.
20. R. Durier, C. Michelot, Geometrical properties of the fermat-weber problem, European J. Oper. Res., 20 (1985) 332-343.
21. R. Durier, C. Michelot, Set of efficient points in a normed space, J. Math. Anal. Appl., 117 (1986) 506-528.
22. F.A. Valentine, Convex Sets, McGraw-Hill, New York, 1964.
23. J.E. Ward, R.E. Wendell, Using block norms for location modeling, Oper. Res., 33 (1985) 1074-1090.
24. F. Plastria, Fully geometric solutions to some planar location problems, Stud. Locat. Anal. 7 (1994) 171-183.
25. J. O'Rourke, C.-B. Chien, T. Olson, D. Naddor. A new linear algorithm for intersecting convex polygons. Comput. Graphics Image Process., 19 (1982) 384-391.
26. 3 and related problems, SIAM J. Comput., 12 (1982) 759-776.
27. M. Blum, W. Floyd, V.R. Ptratt, R.L. Rivest, R.E. Tarjan, Time bounds for selection, J. Comput. System Sci., 7 (1972) 448-461.
28. S. Nickel, H.W. Harnacher, RLP, a program package for solving restricted 1-facility location problems in a user friendly environment. European J. Oper. Res. (ORSEP), 62 (1992) 116-117.