✦ LIBER ✦

Shortest path network interdiction with asymmetric information

✍ Scribed by Halil Bayrak; Matthew D. Bailey

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

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Shortest-path network interdiction

✍ Eitan Israeli; R. Kevin Wood 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 194 KB

Shortest paths in networks with exponent

Shortest paths in networks with exponentially distributed arc lengths

✍ V. G. Kulkarni 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 784 KB

Shortest paths in stochastic networks wi

Shortest paths in stochastic networks with ARC lengths having discrete distributions

✍ Gehan A. Corea; Vidyadhar G. Kulkarni 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 688 KB

## Abstract In this work, we compute the distribution of __L__\*, the length of a shortest __(s, t)__ path, in a directed network __G__ with a source node __s__ and a sink node __t__ and whose arc lengths are independent, nonnegative, integer valued random variables having finite support. We constr

Performance analysis under dynamic loadi

Performance analysis under dynamic loading of wavelength continuous and non-continuous WDM networks with shortest-path routing

✍ Gangxiang Shen; Sanjay K. Bose; Tee Hiang Cheng; Chao Lu; Teck Yoong Chai 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 136 KB

## Abstract The performance of WDM networks using shortest path routing is studied under wavelength continuous (WC) and non‐continuous (NWC) constraints and dynamic traffic loading. Approximate analytical models are presented for the performance studies of such systems. Results of numerical calcula