Extending and solving a multiperiod congested network flow model

DOI10.1016/0305-0548(90)90054-BzbMath0752.90019MaRDI QIDQ1813833

Malachy Carey

Publication date: 25 June 1992

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

penalty function methodpiecewise linear approximationstaircase structurecongested networkconvex cost, linearly constrained, uncapacitated network flowpure processing networktime-varying flows

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (1)

An exit-flow model used in dynamic traffic assignment

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving embedded generalized network problems
• Congested network flows: Time-varying demands and start-time policies
• Basis exchange characterizations for the simplex son algorithm for LP/embedded networks
• Computational comparison of two solution procedures for allocation/processing networks
• A Primal Simplex Approach to Pure Processing Networks
• Optimal Time-Varying Flows on Congested Networks
• A set of staircase linear programming test problems
• The simplex SON algorithm for LP/embedded network problems
• Nested decomposition for dynamic models
• Nested Decomposition and Multi-Stage Linear Programs

This page was built for publication: Extending and solving a multiperiod congested network flow model