Algorithms and complexity for the almost equal maximum flow problem

DOI10.1002/net.22209zbMath1546.9025WikidataQ129416708 ScholiaQ129416708MaRDI QIDQ6541024

Sven O. Krumke, T. Heller, Rebekka Haese

Publication date: 17 May 2024

Published in: Networks (Search for Journal in Brave)

zbMATH Keywords

computational complexitynetwork flowsparametric searchmaximum flowsintegral solutionsequal-flow problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Integer equal flows
• The equal flow problem
• Network simplex algorithm for the general equal flow problem.
• Robust minimum cost flow problem under consistent flow constraints
• A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
• Algorithms for the Simple Equal Flow Problem
• Combinatorial optimization with rational objective functions
• Integrality in the multinetwork min‐cost equal‐flow problem

This page was built for publication: Algorithms and complexity for the almost equal maximum flow problem