Algorithmic aspects of flows in networks

From MaRDI portal





The book is a selfcontained survey of network flow problems and algorithms. Based on a short introduction to graph theory and algorithm's design, several important issues arising in the context of network flows are discussed. The contents of the book is as follows. Chapter 2 presents a maximum flow problem. Goldberg's algorithm is used as a main tool for finding a maximum flow pattern. Chapter 3 discusses a minimum cost flow problem and a network simplex algorithm for solving it. In Chapter 4 generalized networks (i.e. with arc multipliers) are considered. Chapter 5 presents multicriteria network flows and an exact method for bicriteria minimum-cost flows. In Chapter 6 parametric flows and algorithms for several variants of the problem are discussed. In Chapter 7 the problem of detecting network structure in linear programming formulation is presented. Finally in Chapter 8 network flow problems with additional constraints are discussed. Summing up, a large variety of network flow problems and very recent algorithms for solving them are presented and discussed.




Cited in
(28)








This page was built for publication: Algorithmic aspects of flows in networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3995028)