Sensitive and parametric analysis of the maximum flow in a network
From MaRDI portal
Recommendations
- Finding the foremost ares in a network with parametric are capacities
- Revisiting parametric multi-terminal problems: maximum flows, minimum cuts and cut-tree computations
- Parametric flows in static networks
- Parametric max flow problems in a class of networks with series-parallel structure
- A note on the parametric maximum flow problem and some related reoptimization issues
Cited in
(11)- Parametric max flow problems in a class of networks with series-parallel structure
- Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs
- Some concepts of stability analysis in combinatorial optimization
- Parametric analysis on cut-trees and its application on a protein clustering problem
- Sensitivity analysis on the all pairs q-route flows in a network
- scientific article; zbMATH DE number 4204087 (Why is no real title available?)
- scientific article; zbMATH DE number 4207199 (Why is no real title available?)
- scientific article; zbMATH DE number 5371757 (Why is no real title available?)
- Sensitivity analysis of 0-1 multiterminal network flows
- A comprehensive simplex-like algorithm for network optimization and perturbation analysis
- On network flow functions
This page was built for publication: Sensitive and parametric analysis of the maximum flow in a network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3332731)
