A Generalized Upper Bounding Algorithm for Multi-commodity Network Flow Problems
| Author | : James K. Hartman |
| Publisher | : |
| Total Pages | : 41 |
| Release | : 1970 |
| ISBN-10 | : OCLC:227633554 |
| ISBN-13 | : |
| Rating | : 4/5 (54 Downloads) |
Book Synopsis A Generalized Upper Bounding Algorithm for Multi-commodity Network Flow Problems by : James K. Hartman
Download or read book A Generalized Upper Bounding Algorithm for Multi-commodity Network Flow Problems written by James K. Hartman and published by . This book was released on 1970 with total page 41 pages. Available in PDF, EPUB and Kindle. Book excerpt: An algorithm for solving min cost or max flow multicommodity flow problems is described. It is a specialization of the simplex method, which takes advantage of the special structure of the multicommodity problem. The only non-graph or non-additive operations in a cycle involve the inverse of a working basis, whose dimension is the number of currently saturated arcs. Efficient relations for updating this inverse are derived. (Author).
