𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computational complexity of multicommodity flow problems with uniform assignment of flow

✍ Scribed by Hiro Ito

Book ID
112079829
Publisher
John Wiley and Sons
Year
1995
Tongue
English
Weight
839 KB
Volume
78
Category
Article
ISSN
1042-0967

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Multicommodity flow problems with a boun
Multicommodity flow problems with a bounded number of paths: A flow deviation approach
✍ Christophe Duhamel; Philippe Mahey πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 142 KB

## Abstract We propose a modified version of the Flow Deviation method of Fratta, Gerla, and Kleinrock to solve multicommodity problems with minimal congestion and a bounded number of active paths. We discuss the approximation of the min–max objective function by a separable convex potential functi

Methods for parallel computation of comp
Methods for parallel computation of complex flow problems
✍ Tayfun Tezduyar; Yasuo Osawa πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 949 KB

This paper is an overview of some of the methods developed by the Team for Advanced Flow Simulation and Modeling (THAFSM) [http://www.mems.rice.edu/TAFSM/] to support Β―ow simulation and modeling in a number of ``Targeted Challenges''. The ``Targeted Challenges'' include unsteady Β―ows with interfaces