Minimum flows in (s,t) planar networks
From MaRDI portal
Publication:3984281
DOI10.1002/net.3230210705zbMath0747.90034OpenAlexW2037851982MaRDI QIDQ3984281
Jerzy Kamburowski, Barbara Gładysz, Veena G. Adlakha
Publication date: 27 June 1992
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230210705
Abstract computational complexity for mathematical programming problems (90C60) Deterministic network models in operations research (90B10)
Related Items (3)
A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses ⋮ Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights ⋮ A comprehensive simplex-like algorithm for network optimization and perturbation analysis
Cites Work
This page was built for publication: Minimum flows in (s,t) planar networks
