Planar Weber location problems with barriers and block norms

DOI10.1023/A:1018951502447zbMATH Open0997.90043OpenAlexW1519322598MaRDI QIDQ1593532FDOQ1593532

Authors: 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

Recommendations

• Planar location problems with block distance and barriers
• Planar weber location problems with line barriers
• scientific article; zbMATH DE number 1855792
• Locating a 1-center on a Manhattan plane with ``arbitrarily shaped barriers
• An efficient solution method for Weber problems with barriers based on genetic algorithms

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Cited In (22)

• Construction Line Algorithms for the Connection Location-Allocation Problem
• Planar weber location problems with line barriers
• Title not available (Why is that?)
• An efficient solution method for Weber problems with barriers based on genetic algorithms
• Rectilinear distance to a facility in the presence of a square barrier
• A continuous location-allocation problem with zone-dependent fixed cost
• An equivalence result for single facility planar location problems with rectilinear distance and barriers
• Successive computation of some efficient locations of the Weber problem with barriers
• On the use of the varignon frame for single facility Weber problems in the presence of convex barriers
• The multi-facility location-allocation problem with polyhedral barriers
• The rectilinear distance Weber problem in the presence of a probabilistic line barrier
• Title not available (Why is that?)
• Weber problems with high-speed lines
• A discretization result for some optimization problems in framework spaces with polyhedral obstacles and the Manhattan metric
• A reduction result for location problems with polyhedral barriers
• A finite dominating set of cardinality \(O(k)\) and a witness set of cardinality \(O(n)\) for 1.5D terrain guarding problem
• Planar location problems with block distance and barriers
• Continuous location model of a rectangular barrier facility
• Norm-based approximation in multicriteria programming.
• Algebraic properties of location problems with one circular barrier.
• Locating a 1-center on a Manhattan plane with ``arbitrarily shaped barriers
• Multiple obnoxious facility location: the case of protected areas

This page was built for publication: Planar Weber location problems with barriers and block norms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1593532)