✦ LIBER ✦

Minimum cost-reliability ratio path problem

✍ Scribed by R.K. Ahuja

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 535 KB
Volume: 15
Category: Article
ISSN: 0305-0548
DOI: 10.1016/0305-0548(88)90031-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimum-cost line broadcast in paths

✍ Satoshi Fujita; Arthur M. Farley 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 871 KB

Under the line communication protocol, calls can be placed between pairs of non-adjacent sites over a path of lines connecting them; only one call can utilize a line at any time. This paper addresses questions regarding the cumulative cost, i.e., sum of lengths of calls, of broadcasting under the li

On minimal cost-reliability ratio spanni

On minimal cost-reliability ratio spanning trees and related problems

✍ Yung-Cheng Chang; Lih-Hsing Hsu 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 344 KB

Capacity inverse minimum cost flow probl

Capacity inverse minimum cost flow problem

✍ Çiğdem Güler; Horst W. Hamacher 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 463 KB

On minimum reload cost paths, tours, and

On minimum reload cost paths, tours, and flows

✍ Edoardo Amaldi; Giulia Galbiati; Francesco Maffioli 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 267 KB

Bounded-Diameter Minimum-Cost Graph Prob

Bounded-Diameter Minimum-Cost Graph Problems

✍ Sanjiv Kapoor; Mohammad Sarwat 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 228 KB

Paths with minimum range and ratio of ar

Paths with minimum range and ratio of arc lengths

✍ Pierre Hansen; Giovanni Storchi; Tsevi Vovor 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 866 KB

Two new path problems in graphs are studied: MINRANGE, i.e., find a path from a vertex s to a vertex 1 with the smallest possible range of arc lengths. and MINRATIO, i.e., find such a path for which the ratio of the largest to the smallest arc length is minimum. Several bicriterion extensions of the