No open-access location is known for this record yet.
No open-access location is known for this record yet.
In many covering problems, services that customers receive by facilities depend on the distance between the customer and facilities. In a covering problem the customer can receive service by each facility if the distance between the customer and facility is equal or less than a predefined number. This critical value is called coverage distance or coverage radius and shown by Dc . Church and Revelle (1974) modeled the maximization covering problem. Covering problems are divided into two branches; tree networks and general networks, according to their graph. In addition, these problems are divided into two problems: Total covering and partial covering problems, based on covering all or some demand points. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Loading…
Stored only when both papers are in the corpus — 20 citations exist upstream.
Imported from OpenAlex (CC0) — nothing here is generated.