scientific article; zbMATH DE number 3908126

MaRDI QIDQ3685537zbMATH OpenFDO

Authors F. E. Akulich

Publication date 1983

zbMATH Keywords

algorithmdirected networkmaximal stationary dynamic flowminimal arc transit time

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1062936
• A measure-theoretical max-flow problem
• scientific article; zbMATH DE number 1127062
• A new approach to the maximum-flow problem
• An Approximation for a Continuous Max-Flow Problem
• Maximum flows on disjoint paths
• scientific article; zbMATH DE number 6863577
• The maximum flow problem in a network with special conditions of flow distribution
• The maximum concurrent flow problem
• A measure-theoretical max-flow-min-cut problem

Cited in

(6)

• On one maximum multiflow problem and related metrics
• Time minimizing flows in directed networks
• Playing with the Maximum-Flow Problem
• The Maximum Flow Problem for Oriented Flows
• scientific article; zbMATH DE number 5585920 (Why is no real title available?)
• A measure-theoretical max-flow problem

This page was built for publication:

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