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

DOI10.1007/BF03398796zbMath1152.90510OpenAlexW2775299829MaRDI QIDQ2519581

K. V. L. P. Raju, V. V. Rama Reddy, Bhavanari Satyanarayana, V. Ramachandra Raju

Publication date: 26 January 2009

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03398796

zbMATH Keywords

facility locationconvexEuclidean normnon-convexforbidden regionsmini-sum criteriaunconstrained pathbi-section methodHook methodJeeves method

Mathematics Subject Classification ID

Convex programming (90C25) Continuous location (90B85) Nonconvex programming, global optimization (90C26)

Cites Work

• Locational analysis
• Facility location problems in the presence of two-circular forbidden regions with Euclidean distance norm.
• Facility location problems in the presence of single convex/non-convex polygonal barrier/forbidden region.

This page was built for publication: ISO-cost contours to facility location problems in the presence of circular and polygonal forbidden regions