✦ LIBER ✦

Minimum work paths in elevated networks

✍ Scribed by Takeshi Shirabe

Publisher: John Wiley and Sons
Year: 2008
Tongue: English
Weight: 156 KB
Volume: 52
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.20225

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On minimum work paths in perfect plastic

On minimum work paths in perfect plasticity

✍ R.W. Ogden 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 228 KB

A deformation theory of plasticity based

A deformation theory of plasticity based on minimum work paths

✍ Kwansoo Chung; Owen Richmond 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 786 KB

Algorithms for minimum-cost paths in tim

Algorithms for minimum-cost paths in time-dependent networks with waiting policies

✍ Brian C. Dean 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 90 KB

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

Finding alternating minimum cost path in

Finding alternating minimum cost path in a directed network using dynamic programming

✍ S.P. Bansal 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 112 KB

A pseudo-polynomial algorithm for detect

A pseudo-polynomial algorithm for detecting minimum weighted length paths in a network

✍ C.E. Yang; L.R. Foulds; J.L. Scott 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 456 KB