Generalized parametric multi-terminal flows problem.

DOI10.1007/B93953MaRDI QIDQ5902511zbMATH OpenFDO

Authors Pascal Berthomé, Madiagne Diallo, Afonso G. Ferreira

Publication date 12 January 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/B93953

zbMATH Keywords

dynamic networksGomory-Hu cut treemax-flowmin-cutmulti-terminal flowsnetwork managementparametric flowssensitivity analysis

Mathematics Subject Classification ID

Flows in graphs (05C21) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Recommendations

• Revisiting parametric multi-terminal problems: maximum flows, minimum cuts and cut-tree computations
• Sensitivity analysis on the all pairs q-route flows in a network
• Parametric min-cuts analysis in a network.
• A Fast Parametric Maximum Flow Algorithm and Applications
• Sensitivity analysis of 0-1 multiterminal network flows

Cited in

(7)

• Multi-terminal maximum flows in node-capacitated networks
• Parametric analysis on cut-trees and its application on a protein clustering problem
• Revisiting parametric multi-terminal problems: maximum flows, minimum cuts and cut-tree computations
• Impact of a varying capacity on the all pairs 2-route network flows
• Sensitivity analysis on the all pairs q-route flows in a network
• Parametric multiroute flow and its application to robust network with k edge failures
• Sensitivity analysis of 0-1 multiterminal network flows

This page was built for publication: Generalized parametric multi-terminal flows problem.

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