✦ LIBER ✦

On building minimum cost communication networks

✍ Scribed by N. Zadeh

Publisher: John Wiley and Sons
Year: 1973
Tongue: English
Weight: 623 KB
Volume: 3
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230030404

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

The notion of an „exact”︁ test for improving network solutions is discussed. Computational results are presented which indicate the power of „exact”︁ tests relative to current marginal pricing schemes. It is conjectured that each cycle in an optimal solution must contain at least \documentclass{article}\pagestyle{empty}\begin{document}$ 1 + \frac{1}{{1^\alpha - 1}} $\end{document} links, where the cost of a link of length l and capacity y is proportional to 1·y^α^, 0 ≦ α ≦ 1.

A simple „exact”︁ test is presented for the one termianl TELPAK problem.

📜 SIMILAR VOLUMES

On building minimum cost communication n

On building minimum cost communication networks over time

✍ N. Zadeh 📂 Article 📅 1974 🏛 John Wiley and Sons 🌐 English ⚖ 633 KB

Minimum cost flow-dependent communicatio

Minimum cost flow-dependent communication networks

✍ D.A. Thomas; J.F. Weng 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 171 KB

Minimum-cost flows in convex-cost networ

Minimum-cost flows in convex-cost networks

✍ T. C. Hu 📂 Article 📅 1966 🏛 John Wiley and Sons 🌐 English ⚖ 369 KB

The Cost of Complex Communication on Sim

The Cost of Complex Communication on Simple Networks

✍ David S. Greenberg; James K. Park; Eric J. Schwabe 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 258 KB

We do not mean to denigrate the efforts to produce a general-purpose parallel machine. Machines that can realize any communication pattern are of course desirable, and necessary for those cases when the communication needs of a program cannot be predicted in advance. A wide variety of such general-p

Minimum cost dimensioning of ring optica

Minimum cost dimensioning of ring optical networks

✍ Alain Houle; Abdallah Jarray; Brigitte Jaumard 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 759 KB

We consider the problem of traffic grooming of low-rate traffic circuits in WDM rings where circuits are associated with a set of heterogeneous granularities. While networks are no longer limited by transmission bandwidth, the key issue in WDM network design has evolved towards the processing capabi

Minimum cost localization problem in wir

Minimum cost localization problem in wireless sensor networks

✍ Minsu Huang; Siyuan Chen; Yu Wang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 877 KB

Localization is a fundamental problem in wireless sensor networks. Current localization algorithms mainly focus on checking the localizability of a network and/or how to localize as many nodes as possible given a static set of anchor nodes and distance measurements. In this paper, we study a new opt