Invariant sets of arcs in network flow problems

DOI10.1016/0166-218X(86)90063-6zbMath0585.90029OpenAlexW2009174518MaRDI QIDQ1071638

Richard P. Anstee

Publication date: 1986

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(86)90063-6

zbMATH Keywords

network flow problemflows in networks(0,1)- matricesinvariant set of arcs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Matrices of integers (15B36)

Related Items (4)

Solving the Two Color Problem: An Heuristic Algorithm ⋮ Integral matrices with given row and column sums ⋮ X-rays characterizing some classes of discrete sets ⋮ Reconstructing permutation matrices from diagonal sums

Cites Work

• Unnamed Item
• The network flows approach for matrices with given row and column sums
• Matrices of zeros and ones with fixed row and column sum vectors
• Invariant Sets for Classes of Matrices of Zeros and Ones
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

This page was built for publication: Invariant sets of arcs in network flow problems