A facility is called 'extensive'if, for purposes of location, it is too large in relation to its
environment regarding the activities of interest for it to be considered as a point. The …

The tree and tour cover problems on an edge-weighted graph are to compute a minimum
weight tree and closed walk, respectively, whose vertices from a vertex cover. Both problems …

This paper considers the problem of locating a central facility on a tree network. The central
facility takes the form of a subtree of the network and provides service to several demand …

This paper reviews the work published in the past two decades on extensive facility location
problems on networks. The authors start by motivating the topic, introducing the type of …

In two recent papers, similar multifacility problems on tree networks were studied where
facilities are subtrees of the tree. The complexity of the problems was left as open. In this …

This paper concerns the problem of locating a central facility on a connected network N. The
network, N, could be representative of a transport system, while the central facility takes the …

A number of network design problems can be built on the following premise: given an
undirected tree network, T, with node set, V, identify a single subtree, t, containing nodes, v …

Let F be the collection of nonempty subtrees of a given tree T. Each subtree is viewed as a
potential facility. Let ƒ be a real objective function defined on F. The facility location model …

Hutson and ReVelle [8] define the maximal direct covering tree problem as a bicriterion
problem to identify a subtree of a given tree. The two criteria are to maximize demand …

Extensive facility location models on graphs deal with the location of a special type of
subgraphs such as paths, trees or cycles and can be considered as extensions of classical …