Network flows with age dependent decay rates
From MaRDI portal
An arc-chain linear programming formulation of the problem of maximizing the output flow in a multicommodity network in which flow entering an arc experiences a decay rate which is a function of the arc, the commodity and the age of the commodity as it enters the arc is given. The algorithm for solving the problem involves a novel column generation scheme for basis entry embedded in the revised simplex algorithm. An efficient algorithm for generating, at each iteration, such a column is provided and illustrated with a numerical example.
Recommendations
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
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)