Network flows with age dependent decay rates

DOI10.1016/0377-2217(85)90090-6zbMath0567.90030OpenAlexW2029647015MaRDI QIDQ1060129

K. P. K. Nair, Yash 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

multicommodity networkage dependent decay ratesarc-chain linear programming formulationrevised simplex algorithm

Mathematics Subject Classification ID

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

Cites Work

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