MAXIMUM-FLOW PROBLEM IN DISCRETE CONTINUOUS COMPOUND SYSTEM AND ITS NUMERICAL APPROACH

DOI10.15807/JORSJ.21.245zbMATH Open0392.90084OpenAlexW2188507166MaRDI QIDQ4174549FDOQ4174549

Authors: Azuma Taguchi 

Publication date: 1978

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.21.245

zbMATH Keywords

Flows in NetworksMaximum Flow ProblemMinimum-CostShortest PathUrban Road NetworksVehicle Traffic

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Methods of successive quadratic programming type (90C55) Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Extremal problems in graph theory (05C35) Traffic problems in operations research (90B20) Applications of graph theory to circuits and networks (94C15)

This page was built for publication: MAXIMUM-FLOW PROBLEM IN DISCRETE CONTINUOUS COMPOUND SYSTEM AND ITS NUMERICAL APPROACH

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