Facility location in the presence of forbidden regions, I: Formulation and the case of Euclidean distance with one forbidden circle

A constrained form of the Weber problem is formulated in which no path is permitted to enter a prespecified forbidden region R of the plane. Using the calculus of variations the shortest path between two points x, y ∉ R which does not intersect R is determined. If d( x, y) is unconstrained distance,...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	European journal of operational research 1981-02, Vol.6 (2), p.166-173
Hauptverfasser:	Katz, I.Norman, Cooper, Leon
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Areas constrained optimization Constraints Facilities Facility location Location analysis Operations research optimal location Restricted
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!