Time minimizing flows in directed networks

DOI10.1002/NAV.3800290206MaRDI QIDQ3321806zbMATH OpenOpenAlexFDO

Authors Robert G. Hinkle, John J. Jarvis

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

arc capacitybottleneck assignmentdirected networksmaximal flowsolution algorithmtime-minimizing transportation

Mathematics Subject Classification ID

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

Recommendations

• Constructing maximal dynamic flows from static flows
• scientific article; zbMATH DE number 5990494
• Optimal flows in dynamic networks and algorithms for their finding
• The quickest flow problem
• scientific article; zbMATH DE number 3908126

Cites work

• scientific article; zbMATH DE number 2166303 (Why is no real title available?)
• Time‐minimizing transportation problems

Cited in

(12)

• Network flows with age dependent decay rates
• A fast algorithm for the minimax flow problem with 0/1 weights
• The uncapacitated time-space fixed-charge network flow problem: an empirical investigation of procedures for arc capacity assignment
• Bicriterial total cost-maximal transportation time minimization network flow problem
• scientific article; zbMATH DE number 5990494 (Why is no real title available?)
• Universal maximal flow over time in some network with weight at nodes
• The Constrained Bottleneck Problem in Networks
• scientific article; zbMATH DE number 4079141 (Why is no real title available?)
• scientific article; zbMATH DE number 617941 (Why is no real title available?)
• The problem of maximum flow with minimum attainable cost in a network
• Flow in network modeling time tabling and scheduling problem
• Time‐minimizing transportation problems

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

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