Facility Location with Tree Topology and Radial Distance Constraints
Let Gd=V,Ed be an input disk graph with a set of facility nodes V and a set of edges Ed connecting facilities in V. In this paper, we minimize the total connection cost distances between a set of customers and a subset of facility nodes S⊆V and among facilities in S, subject to the condition that no...
Zapisane w:
| Główni autorzy: | , |
|---|---|
| Format: | Artigo |
| Język: | Inglês |
| Wydane: |
Wiley
2019-01-01
|
| Seria: | Complexity |
| Dostęp online: | http://dx.doi.org/10.1155/2019/9723718 |
| Etykiety: |
Nie ma etykietki, Dołącz pierwszą etykiete!
|