Title of article
The Ordered Gradual Covering Location Problem on a Network Original Research Article
Author/Authors
Oded Berman، نويسنده , , J?rg Kalcsics، نويسنده , , Dmitry Krass، نويسنده , , Stefan Nickel، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
19
From page
3689
To page
3707
Abstract
In this paper we develop a network location model that combines the characteristics of ordered median and gradual cover models resulting in the Ordered Gradual Covering Location Problem (OGCLP). The Gradual Cover Location Problem (GCLP) was specifically designed to extend the basic cover objective to capture sensitivity with respect to absolute travel distance
Keywords
Ordered Median Function , Network location , Gradual Covering
Journal title
Discrete Applied Mathematics
Serial Year
2009
Journal title
Discrete Applied Mathematics
Record number
887303
Link To Document