Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
MAXIMUM-FLOW PROBLEM IN DISCRETE CONTINUOUS COMPOUND SYSTEM AND ITS NUMERICAL APPROACH - MaRDI portal

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

From MaRDI portal

Publication:4174549

Jump to:navigation, search

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

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 Networks Shortest Path Maximum Flow Problem Minimum-Cost Urban Road Networks Vehicle Traffic

Mathematics Subject Classification ID

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

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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4174549&oldid=17999613"