A heuristic for blocking flow algorithms

DOI10.1016/0377-2217(94)00360-2zbMath0915.90249OpenAlexW1967902984MaRDI QIDQ1266732

Jesper Larsson Träff

Publication date: 5 July 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)00360-2

zbMATH Keywords

heuristicmaximum flowblocking flowslayered (acyclic) networks

Mathematics Subject Classification ID

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

Related Items (2)

The symbolic algorithms for maximum flow in networks ⋮ Low-energy excitations in the three-dimensional random-field Ising model

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simple version of Karzanov's blocking flow algorithm
• An \(O(IVI^3)\) algorithm for finding maximum flows in networks
• A new approach to the maximum-flow problem
• An O(n2log n) parallel max-flow algorithm

This page was built for publication: A heuristic for blocking flow algorithms