FLOW IN A NETWORK WITH A CHECK NODE

DOI10.15807/JORSJ.23.111MaRDI QIDQ3893694zbMATH OpenOpenAlexFDO

Authors Tetsuo Ichimori, Toshio Nishida, Hiroaki Ishii

Publication date 1980

Published in Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL https://doi.org/10.15807/jorsj.23.111

zbMATH Keywords

check nodeefficient algorithmHu's two- commodity flow algorithmmaximum network flow problempositive gain

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

This page was built for publication: FLOW IN A NETWORK WITH A CHECK NODE

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