๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The optimal location of a path or tree in a tree network

โœ Scribed by Edward Minieka

Publisher
John Wiley and Sons
Year
1985
Tongue
English
Weight
610 KB
Volume
15
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

โœฆ Synopsis

This article describes methods for finding an optimal location for a path-shaped or tree-shaped facility of a specified size in a tree network. Four optimization criteria are examined: minimizing distancesum, minimizing eccentricity, maximizing distancesum, and maximizing eccentricity.

๐Ÿ“œ SIMILAR VOLUMES

Efficient Parallel Algorithms for Optima
Efficient Parallel Algorithms for Optimally Locating a Path and a Tree of a Specified Length in a Weighted Tree Network
โœ Biing-Feng Wang ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 128 KB

In this paper, we propose efficient parallel algorithms on the EREW PRAM for optimally locating in a tree network a path-shaped facility and a tree-shaped facility of a specified length. Edges in the tree network have arbitrary positive lengths. Two optimization criteria are considered: minimum ecce

On the location of a tree-shaped facilit
On the location of a tree-shaped facility
โœ Kim, Tae Ung; Lowe, Timothy J.; Tamir, Arie; Ward, James E. ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 769 KB

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 points located at the nodes of the network. Two types of costs are involved in evaluating a given facility selecti

Path coverings of the vertices of a tree
Path coverings of the vertices of a tree
โœ Peter J. Slater ๐Ÿ“‚ Article ๐Ÿ“… 1979 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 840 KB

Consider a collection of disjoint paths in graph G such that every vertex is on one of these paths. The size of the smallest such collection is denoted i(G). A procedure for forming such collections is established. Restricting attention to trees, the range of values for the sizes of the collections