𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Locating a cycle in a transportation or a telecommunications network

✍ Scribed by Gilbert Laporte; Inmaculada Rodríguez Martín

Publisher
John Wiley and Sons
Year
2007
Tongue
English
Weight
277 KB
Volume
50
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new proximal decomposition algorithm f
A new proximal decomposition algorithm for routing in telecommunication networks
✍ Mahey, P.; Ouorou, A.; LeBlanc, L.; Chifflet, J. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 125 KB 👁 2 views

We present a new and much more efficient implementation of the proximal decomposition algorithm for routing in congested telecommunication networks. The routing model that we analyze is a static one intended for use as a subproblem in a network design context. After describing our new implementation

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

Solving the hub location problem in a st
Solving the hub location problem in a star–star network
✍ Martine Labbé; Hande Yaman 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 273 KB 👁 1 views

## Abstract We consider the problem of locating hubs and assigning terminals to hubs for a telecommunication network. The hubs are directly connected to a central node and each terminal node is directly connected to a hub node. The aim is to minimize the cost of locating hubs, assigning terminals a

Trade-offs on the location of the core n
Trade-offs on the location of the core node in a network
✍ Jean-François Macq; Michel X. Goemans 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 128 KB

## Abstract We consider the problem of selecting a core node in a network under two potentially competing criteria, one being the sum of the distances to a set of terminals, the other being the cost of connecting this core node and the terminals with a Steiner tree. We characterize the worst‐case t