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

Finding the conditional location of a median path on a tree

โœ Scribed by Biing-Feng Wang; Tzu-Chin Lin; Chien-Hsin Lin; Shan-Chyun Ku

Book ID
113641774
Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
237 KB
Volume
206
Category
Article
ISSN
0890-5401

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Minmax-regret robust 1-median location o
Minmax-regret robust 1-median location on a tree
โœ Chen, Bintong; Lin, Chin-Shien ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 171 KB

This paper considers the minmax-regret 1-median problem on a tree network where edge lengths and node weights are uncertain and the uncertainty is characterized by given intervals. Some localization properties for the optimal locations, for both the node-restricted and the unrestricted cases, are de

A note on finding shortest path trees
A note on finding shortest path trees
โœ Aaron Kershenbaum ๐Ÿ“‚ Article ๐Ÿ“… 1981 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 107 KB ๐Ÿ‘ 1 views
The location of median paths on grid gra
The location of median paths on grid graphs
โœ Ronald I. Becker; Isabella Lari; Andrea Scozzari; Giovanni Storchi ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Springer US ๐ŸŒ English โš– 341 KB
The optimal location of a path or tree i
The optimal location of a path or tree in a tree network
โœ Edward Minieka ๐Ÿ“‚ Article ๐Ÿ“… 1985 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 610 KB

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.