✦ LIBER ✦

Minimum cost flow-dependent communication networks

✍ Scribed by D.A. Thomas; J.F. Weng

Publisher: John Wiley and Sons
Year: 2006
Tongue: English
Weight: 171 KB
Volume: 48
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.20118

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

Heuristic solutions for general concave

Heuristic solutions for general concave minimum cost network flow problems

✍ Dalila B.M.M. Fontes; José Fernando Gonçalves 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 214 KB

## Abstract We address the single‐source uncapacitated minimum cost network flow problem with general concave cost functions. Exact methods to solve this class of problems in their full generality are only able to address small to medium size instances, since this class of problems is known to be N

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

Upper bounds for single-source uncapacit

Upper bounds for single-source uncapacitated concave minimum-cost network flow problems

✍ Dalila B. M. M. Fontes; Eleni Hadjiconstantinou; Nicos Christofides 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 110 KB

A note on minimum cost convex flows

✍ D. L. Adolphson 📂 Article 📅 1976 🏛 John Wiley and Sons 🌐 English ⚖ 92 KB