Network flow programming / Paul A. Jensen, J. Wesley Barnes.
By: Jensen, Paul A
.
Contributor(s): Barnes, J. Wesley.
Material type: 
BookPublisher: New York : Wiley, c1980Description: xiv, 408 p. : ill. ; 24 cm. + hbk.ISBN: 0471044717.Subject(s): Network analysis (Planning) | Programming (Mathematics)DDC classification: 511.5 | Item type | Current library | Call number | Copy number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|---|
| General Lending | MTU Bishopstown Library Store Item | 511.5 (Browse shelf(Opens below)) | 1 | Available | 00038781 |
Enhanced descriptions from Syndetics:
Contains a synthesis of the more important techniques, both recent and traditional related to network flow programming. Emphasis concepts rather than proofs and presents a complete exposition of the total spectrum of single commodity network flow programming problems, ranging from such basic topics as network storage techniques and handling representations to such advanced topics as stochastic and generalized networks. Provides an estensive bibliography to the literature which presents theoretical underpinnings of the subject.
Bibliography: p. 391-402. - Includes index.
Network flow models -- Modelling applications of network programming -- Formalization of network models -- Network manipulation algorithms -- The shortest path problem -- The maximum flow problem -- Pure minimum cost flow problems -- The out of kilter algorithm -- Network manipualtion algorithms for generalized network -- Generalized minimum cost flow problems -- The convex minimum cost flow problem -- Concave costs.