✦ LIBER ✦

Problem 59-5, A Minimum Switching Network

✍ Scribed by Raphael Miller

Book ID: 124930254
Publisher: Society for Industrial and Applied Mathematics
Year: 1959
Tongue: English
Weight: 232 KB
Volume: 1
Category: Article
ISSN: 0036-1445
DOI: 10.2307/2027543

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Problem 61-1, Another Minimum Switching

Problem 61-1, Another Minimum Switching Network

✍ A. H. McMorris 📂 Article 📅 1961 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 83 KB

Problem 59-5

✍ A. H. McMorris 📂 Article 📅 1961 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 121 KB

Problem 59-5

✍ Layton E. Butts and A. C. McMorris 📂 Article 📅 1961 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 128 KB

Problem 59-7 (Corrected), A Minimum Time

Problem 59-7 (Corrected), A Minimum Time Path

✍ D. J. Newman 📂 Article 📅 1962 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 169 KB

A Maximum, Minimum Problem: Problem 82-5

✍ O. P. Lossers 📂 Article 📅 1983 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 126 KB

A neural network method for minimum dela

A neural network method for minimum delay routing in packet-switched networks

✍ G Feng; C Douligers 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 147 KB

In this paper, a neural networks (NNs) based two-phase routing algorithm is proposed. The aim of the ®rst phase is to ®nd a set of alternative routes for each commodity, while the traf®c of each commodity is optimally distributed on the alternative routes in the second phase. Our ®nal goal is to rou