Planar Weber location problems with barriers and block norms
From MaRDI portal
Publication:1593532
DOI10.1023/A:1018951502447zbMath0997.90043OpenAlexW1519322598MaRDI QIDQ1593532
Kathrin Klamroth, Horst W. Hamacher
Publication date: 17 January 2001
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1018951502447
Related Items
An efficient solution method for Weber problems with barriers based on genetic algorithms ⋮ A finite dominating set of cardinality \(O(k)\) and a witness set of cardinality \(O(n)\) for 1.5D terrain guarding problem ⋮ Weber problems with high-speed lines ⋮ Norm-based approximation in multicriteria programming. ⋮ Algebraic properties of location problems with one circular barrier. ⋮ Construction Line Algorithms for the Connection Location-Allocation Problem ⋮ Continuous location model of a rectangular barrier facility ⋮ Rectilinear distance to a facility in the presence of a square barrier ⋮ A reduction result for location problems with polyhedral barriers ⋮ Successive computation of some efficient locations of the Weber problem with barriers ⋮ The rectilinear distance Weber problem in the presence of a probabilistic line barrier ⋮ A continuous location-allocation problem with zone-dependent fixed cost ⋮ Planar location problems with block distance and barriers
