✦ LIBER ✦

Exact algorithms for minimum routing cost trees

✍ Scribed by Matteo Fischetti; Giuseppe Lancia; Paolo Serafini

Publisher: John Wiley and Sons
Year: 2002
Tongue: English
Weight: 260 KB
Volume: 39
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.10022

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Two exact algorithms for the vehicle rou

Two exact algorithms for the vehicle routing problem on trees

✍ Pontien Mbaraga; André Langevin; Gilbert Laporte 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 80 KB 👁 2 views

This article describes a heuristic and two exact algorithms for several classes of vehicle routing problems defined on tree networks. These include capacitated and time-constrained vehicle routing problems. One of the exact algorithms is based on the computation of bin packing lower bounds. The othe

Euclidean Steiner minimum trees: An impr

Euclidean Steiner minimum trees: An improved exact algorithm

✍ Winter, Pawel; Zachariasen, Martin 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 296 KB

The Euclidean Steiner tree problem asks for a shortest network interconnecting a set of terminals in the plane. Over the last decade, the maximum problem size solvable within 1 h (for randomly generated problem instances) has increased from 10 to approximately 50 terminals. We present a new exact al

Traffic flow information for minimum cos

Traffic flow information for minimum cost routing procedures

✍ B. Yaged Jr. 📂 Article 📅 1969 🏛 Elsevier Science 🌐 English ⚖ 520 KB

For networks in which traffic flows are routed for minimum cost, an efficient technique is presented which provides detailed understanding of traffic flow patterns. Summary--For a two-way communications network in which each link is assigned a cost per traffic unit, a minimum cost routing policy (M

An exact algorithm for minimizing routin

An exact algorithm for minimizing routing and operating costs in depot location

✍ Gilbert Laporte; Yves Nobert 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 254 KB

Cost-optimal parallel algorithms for con

Cost-optimal parallel algorithms for constructing B-trees

✍ Wang Biing-Feng; Chen Gen-Huey 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 884 KB

Faster exact algorithms for steiner tree

Faster exact algorithms for steiner trees in planar networks

✍ Marshall Bern 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 739 KB

We improve the time and space complexities of dynamic programming algorithms that compute optimal Steiner trees spanning nodes in planar networks. Our algorithms have special application to the rectilinear Steiner problem.