✦ LIBER ✦

Algorithms for Placing Monitors in a Flow Network

✍ Scribed by Francis Chin, Marek Chrobak, Li Yan

Book ID: 120910000
Publisher: Springer
Year: 2012
Tongue: English
Weight: 601 KB
Volume: 68
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-012-9665-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Algorithms for solving for the minimal f

Algorithms for solving for the minimal flow in a network

✍ Yu V. Voitishin 📂 Article 📅 1980 🏛 Springer US 🌐 English ⚖ 329 KB

Combinatorial algorithms for inverse net

Combinatorial algorithms for inverse network flow problems

✍ Ravindra K. Ahuja; James B. Orlin 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 122 KB

An inverse optimization problem is defined as follows: Let S denote the set of feasible solutions of an optimization problem P, let c be a specified cost vector, and x 0 ʦ S. We want to perturb the cost vector c to d so that x 0 is an optimal solution of P with respect to the cost vector d, and wʈd

A Network-Flow Algorithm for Project Sel

A Network-Flow Algorithm for Project Selection

✍ Barrie M. Baker 📂 Article 📅 1984 🏛 Palgrave Publishers Ltd. 🌐 English ⚖ 171 KB

A note on primal network flow algorithms

✍ K. Hässig; P. Reiser; C. Stierlin 📂 Article 📅 1978 🏛 Springer 🌐 English ⚖ 125 KB

A flow-based network monitoring framewor

A flow-based network monitoring framework for wireless mesh networks

✍ Huang, Feiyi; Yang, Yang; He, Liwen 📂 Article 📅 2007 🏛 IEEE 🌐 English ⚖ 162 KB

A simplex algorithm for minimum-cost net

A simplex algorithm for minimum-cost network-flow problems in infinite networks

✍ Thomas C. Sharkey; H.Edwin Romeijn 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 217 KB