Error bounds for the approximative solution of restricted planar location problems

European Journal of Operational Research

Volumn 135, Issue 1, 2001, Pages 67-85

  Käfer, Barbara ^a   Nickel, Stefan ^b  

^a Quelle AG   (Germany)

^b FRAUNHOFER INSTITUTE FOR INDUSTRIAL MATHEMATICS ITWM   (Germany)

Author keywords

Approximation; Computational analysis; GIS; Location; Optimization

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BOUNDARY VALUE PROBLEMS; COMPUTATIONAL GEOMETRY; COMPUTATIONAL METHODS; MATHEMATICAL MODELS; PROBLEM SOLVING;

PLANAR LOCATION PROBLEMS;

MATHEMATICAL PROGRAMMING;

EID: 0035900275     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(00)00293-9     Document Type: Article

References (20)

1. Algorithms for weber facility location in the presence of forbidden regions and/or barriers to travel
2. Sandwich approximation of univariate convex functions with an application to separable convex programming
3. Solving nonconvex planar location problems by finite dominating sets
4. The Weber problem on the plane with some negative weights
5. Facility location
6. Geometrical properties of the Fermat-Weber problem
7. Combinatorial algorithms for some 1-facility median problems in the plane
8. Restricted planar location problems and applications
9. Multicriteria planar location problems
10. Classification of location models
11. Localisation in multifacility location theory
12. Weber's problem with attraction and repulsion under polyhedral gauges
13. The convergence rate of the sandwich algorithm for approximating convex functions
14. Using block norms for location modeling