Minimum flow variation in maximum flows

DOI10.1142/S1793830910000735zbMATH Open1201.05043MaRDI QIDQ3063609FDOQ3063609

Authors: M. E. Masoumi, A. M. Mobasseri, A. R. Rezaei 

Publication date: 15 December 2010

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Recommendations

• The minimal average cost flow problem
• Minimum cost flow problem
• Minimum cost flow in a network with an overestimated arc capacity
• Optimal flows in dynamic networks and algorithms for their finding
• scientific article; zbMATH DE number 1984104

zbMATH Keywords

line digraphshortest path algorithmmax flow-min cost problem

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Flows in graphs (05C21)

Cites Work

• Network flows. Theory, algorithms, and applications.
• Maximal Flow Through a Network
• A note on two problems in connexion with graphs
• On a routing problem
• Title not available (Why is that?)
• Some properties of line digraphs

Cited In (4)

• Finding maximum minimum cost flows to evaluate gas network capacities
• Title not available (Why is that?)
• Maximum cuts for a minimum flow
• A min-max relation in flowgraphs

This page was built for publication: Minimum flow variation in maximum flows

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