Facility location problems in the presence of single convex/non-convex polygonal barrier/forbidden region.

DOI10.1007/BF03398836zbMath1151.90481MaRDI QIDQ2477119

K. V. L. P. Raju, Bhavanari Satyanarayana, K. V. Viswa Mohan

Publication date: 13 March 2008

Published in: Opsearch (Search for Journal in Brave)

zbMATH Keywords

facility locationEuclidean normforbidden regionsconvex/non-convexHook and Jeeves methodmini-sum criteriaunconstrained path

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Related Items (1)

ISO-cost contours to facility location problems in the presence of circular and polygonal forbidden regions

Cites Work

• Finding shortest paths in the plane in the presence of barriers to travel (for any \(l_ p\)-norm)
• Facility location in the presence of forbidden regions. I: Formulation and the case of Euclidean distance with one forbidden circle
• Bicriteria single facility rectilinear location problems in the presence of a single forbidden region
• Facility location problems in the presence of two-circular forbidden regions with Euclidean distance norm.
• `` Direct Search Solution of Numerical and Statistical Problems

This page was built for publication: Facility location problems in the presence of single convex/non-convex polygonal barrier/forbidden region.