Network flows with age dependent decay rates

DOI10.1016/0377-2217(85)90090-6MaRDI QIDQ1060129zbMATH OpenOpenAlexFDO

Authors K. P. K. Nair, Y. P. Aneja

Publication date 1985

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-2217(85)90090-6

zbMATH Keywords

age dependent decay ratesarc-chain linear programming formulationmulticommodity networkrevised simplex algorithm

Mathematics Subject Classification ID

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

Recommendations

• Constructing maximal dynamic flows from static flows
• Optimal flows in dynamic networks and algorithms for their finding
• A continuous-time network simplex algorithm
• Time minimizing flows in directed networks
• scientific article; zbMATH DE number 3934807

Cites work

• A note on two problems in connexion with graphs
• Calculating Maximal Flows in a Network with Positive Gains
• Maximal expected flow in a network subject to arc failures
• Multi-Commodity Multi-Transformed Network Flows with an Application to Residuals Management
• Multicommodity Network Flows with Probabilistic Losses
• New Methods in Mathematical Programming—Optimal Flow Through Networks with Gains
• Optimal Flow In A Network With Gains^*
• Shortest chain subject to side constraints

Cited in

(1)

• scientific article; zbMATH DE number 4126979 (Why is no real title available?)

This page was built for publication: Network flows with age dependent decay rates

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