An analogue of Hoffman's circulation conditions for max-balanced flows

DOI10.1007/BF01581095MaRDI QIDQ1802959zbMATH OpenOpenAlexFDO

Authors Michael H. Schneider, Mark Hartmann

Publication date 29 June 1993

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01581095

zbMATH Keywords

directed graphbottleneck pathsmax-balanced flow

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Recommendations

• scientific article; zbMATH DE number 5585920
• Maximization of the velocity circulation in a flow around a smooth contour with sources and sinks
• A Pontryagin maximum principle for systems of flows
• Energetic balance for the Rayleigh-Stokes problem of a Maxwell fluid
• Stability of steady flows for multi-mode Maxwell fluids
• Friedrichs inequalities and sharpened sufficient stability conditions of plane-parallel flows
• Maximal mixing by incompressible fluid flows
• Solutions in closed-form for unsteady unidirectional flow of a Maxwell fluid
• On maximally mixed equilibria of two-dimensional perfect fluids
• scientific article; zbMATH DE number 1332327

Cites work

• scientific article; zbMATH DE number 4130423 (Why is no real title available?)
• scientific article; zbMATH DE number 3887060 (Why is no real title available?)
• scientific article; zbMATH DE number 3156381 (Why is no real title available?)
• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 3936534 (Why is no real title available?)
• scientific article; zbMATH DE number 3735581 (Why is no real title available?)
• scientific article; zbMATH DE number 3759934 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A Shortest Path Algorithm for Edge-Sparse Graphs
• Algebraic and combinatorial methods in operations research. Proceedings of the Workshop on Algebraic Structures in Operations Research
• Algebraic flows in regular matroids
• Augmentation Problems
• Bottleneck extrema
• Characterizations of max-balanced flows
• Connectivity in digraphs
• Decomposition of group flows in regular matroids
• Depth-First Search and Linear Graph Algorithms
• Diagonal similarity and equivalence for matrices over groups with 0
• Duality for algebraic linear programming
• Flow symmetry and algebraic flows
• Linear and combinatorial optimization in ordered algebraic structures
• Max-Balancing Weighted Directed Graphs and Matrix Scaling
• Max-balanced flows in oriented matroids
• Minimal cost flows in regular matroids
• On abstract dual linear programs
• Solutions of the Shortest-Route Problem—A Review
• The Complexity of Enumeration and Reliability Problems
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

Cited in

(5)

• Integral bases and \(p\)-twisted digraphs
• Balanced flows for transshipment problems
• Max-balanced flows in oriented matroids
• Characterizations of max-balanced flows
• Flow symmetry and algebraic flows

Describes a project that uses

Uses Software

• Algorithm 360

This page was built for publication: An analogue of Hoffman's circulation conditions for max-balanced flows

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