An analogue of Hoffman's circulation conditions for max-balanced flows
From MaRDI portal
Publication:1802959
DOI10.1007/BF01581095zbMath0787.90027OpenAlexW1968351805MaRDI QIDQ1802959
Michael H. Schneider, Mark E. 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
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Related Items (4)
Max-balanced flows in oriented matroids ⋮ Integral bases and \(p\)-twisted digraphs ⋮ Flow symmetry and algebraic flows ⋮ Characterizations of max-balanced flows
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algebraic and combinatorial methods in operations research. Proceedings of the Workshop on Algebraic Structures in Operations Research
- Algebraic flows in regular matroids
- Duality for algebraic linear programming
- Linear and combinatorial optimization in ordered algebraic structures
- Decomposition of group flows in regular matroids
- Characterizations of max-balanced flows
- Max-balanced flows in oriented matroids
- Connectivity in digraphs
- Solutions of the Shortest-Route Problem—A Review
- Max-Balancing Weighted Directed Graphs and Matrix Scaling
- The Complexity of Enumeration and Reliability Problems
- Minimal cost flows in regular matroids
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- A Shortest Path Algorithm for Edge-Sparse Graphs
- Diagonal similarity and equivalence for matrices over groups with 0
- Augmentation Problems
- Flow symmetry and algebraic flows
- Bottleneck extrema
- Depth-First Search and Linear Graph Algorithms
- On abstract dual linear programs
This page was built for publication: An analogue of Hoffman's circulation conditions for max-balanced flows
