The gradual covering decay location problem on a network

In covering problems it is assumed that there is a critical distance within which the demand point is fully covered, while beyond this distance it is not covered at all. In this paper we define two distances. Within the lower distance a demand point is fully covered and beyond the larger distance it...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	European journal of operational research 2003-12, Vol.151 (3), p.474-480
Hauptverfasser:	Berman, Oded, Krass, Dmitry, Drezner, Zvi
Format:	Artikel
Sprache:	eng
Schlagworte:	Communications networks Integer programming Location Maximal cover problems Networks Studies
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!