✦ LIBER ✦

A multicommodity flow problem

✍ Scribed by E. Kant

Publisher: John Wiley and Sons
Year: 1974
Tongue: English
Weight: 599 KB
Volume: 4
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230040306

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Multicommodity flow problem

✍ V. I. Shevchik 📂 Article 📅 1993 🏛 Springer US 🌐 English ⚖ 191 KB

Multicommodity networks with resource co

Multicommodity networks with resource constraints: The generalized multicommodity flow problem

✍ R. D. Wollmer 📂 Article 📅 1971 🏛 John Wiley and Sons 🌐 English ⚖ 780 KB

Network topology and integral multicommo

Network topology and integral multicommodity flow problems

✍ J. R. Evans; J. J. Jarvis 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 484 KB

An algorithm for nonlinear multicommodit

An algorithm for nonlinear multicommodity flow problems

✍ R. W. Klessig 📂 Article 📅 1974 🏛 John Wiley and Sons 🌐 English ⚖ 541 KB

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

A computationally efficient method for n

A computationally efficient method for nonlinear multicommodity network flow problems

✍ Lin, Shin-Yeu; Lin, Ch'i-Hsin 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 301 KB 👁 2 views

In this paper, we present a new method for solving nonlinear multicommodity network flow problems with convex objective functions. This method combines a well-known projected Jacobi method and a new dual projected pseudo-quasi-Newton (DPPQN) method which solves multicommodity flow quadratic subprobl