Parametric min-cuts analysis in a network.

DOI10.1016/S0166-218X(02)00496-1zbMath1038.90062MaRDI QIDQ1811086

R. Chandrasekaran, K. P. K. Nair, Yash P. Aneja

Publication date: 10 June 2003

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

Combinatorial optimizationParametric analysisMultiterminal maximal flows

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Related Items (3)

Flows over edge-disjoint mixed multipaths and applications ⋮ Maximum flows in parametric graph templates ⋮ Parametric analysis of overall min-cuts and applications in undirected networks.

Cites Work

• Multi-Terminal Network Flows
• Maximal expected flow in a network subject to arc failures
• Bicriteria Transportation Problem
• Minimal ratio spanning trees
• Maximizing residual flow under an arc destruction
• A Fast Parametric Maximum Flow Algorithm and Applications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Parametric min-cuts analysis in a network.