Time minimizing flows in directed networks

DOI10.1002/NAV.3800290206zbMATH Open0536.90034OpenAlexW2116021228MaRDI QIDQ3321806

John J. Jarvis, Robert G. Hinkle

Publication date: 1982

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800290206

zbMATH Keywords

solution algorithmarc capacitydirected networksmaximal flowbottleneck assignmenttime-minimizing transportation

Mathematics Subject Classification ID

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

Cites Work

• Time‐minimizing transportation problems
• Unnamed Item

This page was built for publication: Time minimizing flows in directed networks