On the Location of a Constrained k-Tree Facility in a Tree Network with Unreliable Edges
Given a tree network T with n vertices where each edge has an independent operational probability, we are interested in finding the optimal location of a reliable service provider facility in a shape of subtree with exactly k leaves and with a diameter of at most l which maximizes the expected numbe...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2019-01-01
|
| Series: | Journal of Applied Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2019/9520324 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|