Algorithmic aspects of flows in networks
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.
- The convergence rate of the sandwich algorithm for approximating convex functions
- Programming in networks and graphs. On the combinatorial background and near-equivalence of network flow and matching algorithms
- A method for convex curve approximation
- Pre-processing techniques for resource allocation in the heterogeneous case
- New algorithms for generalized network flows
- A branch-and-bound algorithm for the transportation problem with location of p transshipment points
- Approximation methods for non-convex curves
- A multifacility location problem on median spaces
- Discrete-time model for a motion of substance in a channel of a network with application to channels of human migration
- Statistical distributions connected to motion of substance in a channel of a network
- Algorithms for placing monitors in a flow network
- Finding representative systems for discrete bicriterion optimization problems
- Network flows. Theory, algorithms, and applications.
- Some Recent Advances in Network Flows
- Network as a Computer: Ranking Paths to Find Flows
- Algorithmic Properties of Millstream Systems
- scientific article; zbMATH DE number 3982887 (Why is no real title available?)
- scientific article; zbMATH DE number 4070603 (Why is no real title available?)
- A comparison of phase and nonphase network flow algorithms
- Diagnosing Infeasibility in Min-cast Network Flow Problems Part I: Dual Infeasibility
- scientific article; zbMATH DE number 49483 (Why is no real title available?)
- The quickest flow problem
- Analytic efficient solution set for bi-criteria quadratic network programs
- Minimum parametric flow in time-dependent dynamic networks
- Network Flow in Graph Theory - The Producer’s Problem
- Network flow algorithms
- Network flows and non-guillotine cutting patterns
- Multiple objective minimum cost flow problems: a review
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)