Sie befinden Sich nicht im Netzwerk der Universität Paderborn. Der Zugriff auf elektronische Ressourcen ist gegebenenfalls nur via VPN oder Shibboleth (DFN-AAI) möglich. mehr Informationen...
The gradual covering decay location problem on a network
Ist Teil von
European journal of operational research, 2003-12, Vol.151 (3), p.474-480
Ort / Verlag
Amsterdam: Elsevier B.V
Erscheinungsjahr
2003
Quelle
ScienceDirect
Beschreibungen/Notizen
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 is not covered at all. For a distance between these two values we assume a gradual coverage decreasing from full coverage at the lower distance to no coverage at the larger distance.