✦ LIBER ✦

A generalized upper bounding algorithm for multicommodity network flow problems

✍ Scribed by J. K. Hartman; L. S. Lasdon

Book ID: 118285458
Publisher: John Wiley and Sons
Year: 1971
Tongue: English
Weight: 733 KB
Volume: 1
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230010404

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Specialized Interior-Point Algorithm f

A Specialized Interior-Point Algorithm for Multicommodity Network Flows

✍ Castro, Jordi 📂 Article 📅 2000 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 290 KB

Implementing a proximal algorithm for so

Implementing a proximal algorithm for some nonlinear multicommodity flow problems

✍ Adam Ouorou 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 193 KB

A heuristic algorithm for a network prob

A heuristic algorithm for a network problem with variable upper bounds

✍ Bala Shetty 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 929 KB

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

Cycle-based algorithms for multicommodit

Cycle-based algorithms for multicommodity network flow problems with separable piecewise convex costs

✍ Mauricio C. de Souza; Philippe Mahey; Bernard Gendron 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 181 KB

A Branch-and-Bound Algorithm for Concave

A Branch-and-Bound Algorithm for Concave Network Flow Problems

✍ Dalila B. M. M. Fontes; Eleni Hadjiconstantinou; Nicos Christofides 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 279 KB