Sensitivity analysis of 0-1 multiterminal network flows

DOI10.1002/NET.3230210703MaRDI QIDQ3984278zbMATH OpenOpenAlexFDO

Authors Shiow C. Lin, Eva Ma

Publication date 27 June 1992

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230210703

zbMATH Keywords

cut treeedge deletion algorithmedge insertion algorithmmultiterminal maximum flow problemrandom connected graphsundirected 0-1 flow network

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Boolean programming (90C09) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Generalized parametric multi-terminal flows problem.
• Revisiting parametric multi-terminal problems: maximum flows, minimum cuts and cut-tree computations
• A decomposition algorithm for multi-terminal network flows
• Very Simple Methods for All Pairs Network Flow Analysis
• Sensitive and parametric analysis of the maximum flow in a network

Cites work

• Maximal Flow Through a Network

Cited in

(5)

• Parametric analysis on cut-trees and its application on a protein clustering problem
• “More(Same)-for-Less” Paradox In Minimal Cost Network Flow Problem
• Generalized parametric multi-terminal flows problem.
• Network efficiency and vulnerability analysis using the flow‐weighted efficiency measure
• A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses

This page was built for publication: Sensitivity analysis of 0-1 multiterminal network flows

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