Dominating sets for rectilinear center location problems with polyhedral barriers

DOI10.1002/nav.10038zbMath1037.90044OpenAlexW2095396067MaRDI QIDQ4805631

Horst W. Hamacher, P. M. Dearing, Kathrin Klamroth

Publication date: 8 May 2003

Published in: Naval Research Logistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.10038

zbMATH Keywords

locationpolyhedral barriers

Mathematics Subject Classification ID

Continuous location (90B85) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (13)

An efficient solution method for Weber problems with barriers based on genetic algorithms ⋮ Placing a finite size facility with a center objective on a rectangular plane with barriers ⋮ Median location problem with two probabilistic line barriers: extending the Hooke and Jeeves algorithm ⋮ Contour line construction for a new rectangular facility in an existing layout with rectangular departments ⋮ Weber problems with high-speed lines ⋮ Algebraic properties of location problems with one circular barrier. ⋮ Conditional facility location problems with continuous demand and a polygonal barrier ⋮ Continuous location model of a rectangular barrier facility ⋮ Rectilinear distance to a facility in the presence of a square barrier ⋮ Facility placement with sub-aisle design in an existing layout ⋮ The rectilinear distance Weber problem in the presence of a probabilistic line barrier ⋮ A wavefront approach to center location problems with barriers ⋮ Planar location problems with block distance and barriers

Cites Work

• Farthest neighbors and center points in the presence of rectngular obstacles

This page was built for publication: Dominating sets for rectilinear center location problems with polyhedral barriers