scientific article; zbMATH DE number 221929

DOI<link itemprop=identifier href="https://doi.org/10.1002/1520-6750(199304)40:3<393::AID-NAV3220400308>3.0.CO;2-1" /><393::AID-NAV3220400308>3.0.CO;2-1 10.1002/1520-6750(199304)40:3<393::AID-NAV3220400308>3.0.CO;2-1zbMath0792.90026MaRDI QIDQ4697333

Gary R. Waissi

Publication date: 29 June 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

maximum value flowsdirected single-commodity networks

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Parallel numerical computation (65Y05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

• A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

This page was built for publication: