Error bounds for the approximative solution of restricted planar location problems

DOI10.1016/S0377-2217(00)00293-9zbMath1077.90549MaRDI QIDQ5954828

Stefan Nickel, Barbara Käfer

Publication date: 2001

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

OptimizationLocationApproximationComputational analysisGIS

Mathematics Subject Classification ID

Continuous location (90B85) Nonlinear programming (90C30)

Related Items (4)

Logistics distribution centers location problem and algorithm under fuzzy environment ⋮ Search region contraction of the Weber problem solution on the plane with rectangular forbidden zones ⋮ Facility location models for distribution system design ⋮ Complexity results on planar multifacility location problems with forbidden regions

Uses Software

• LoLA

Cites Work

• Unnamed Item
• Unnamed Item
• Geometrical properties of the Fermat-Weber problem
• Localization in multifacility location theory
• The convergence rate of the sandwich algorithm for approximating convex functions
• Multicriteria planar location problems
• Combinatorial algorithms for some 1-facility median problems in the plane
• Weber's problem with attraction and repulsion under polyhedral gauges
• The Weber Problem On The Plane With Some Negative Weights
• Using Block Norms for Location Modeling
• Sandwich approximation of univariate convex functions with an application to separable convex programming
• Technical Note—Algorithms for Weber Facility Location in the Presence of Forbidden Regions and/or Barriers to Travel
• Solving nonconvex planar location problems by finite dominating sets

This page was built for publication: Error bounds for the approximative solution of restricted planar location problems