الفهرس 
The location of a core in a tree networkOnly 14 pages are availabe for public view
 |  | from | 73 |  |  |
| | | from | 73 | | |
Abstract
The traditional facility location problem on a network is concerned with the optimal selection of a single facility at either a node or along an edge of the network. The most common two criteria for optimality used in literature are the mini-sum criterion in which the sum of the distances from all the nodes of the network to the facility is minimized and the mini-max criterion in which the distance from the facility to the furthest vertex is minimized. The distance between two nodes is the length of the shortest path between them. The location of special types of subgraphs such as paths or trees is called extensive facility location. In this thesis, we consider the location of two cores in a tree network with unreliable edges. This problem consists of locating two path-shaped facilities on a tree network so that the expected number of disconnected demand nodes from the two cores facilities is minimized.