Sensitivity analysis of 0-1 multiterminal network flows

DOI10.1002/net.3230210703zbMath0743.90046OpenAlexW1996288330MaRDI QIDQ3984278

Eva Ma, Shiow C. Lin

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

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

Related Items (2)

“More(Same)-for-Less” Paradox In Minimal Cost Network Flow Problem ⋮ A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses

Cites Work

• Maximal Flow Through a Network

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