Extending and solving a multiperiod congested network flow model
DOI10.1016/0305-0548(90)90054-BzbMATH Open0752.90019MaRDI QIDQ1813833FDOQ1813833
Authors: Malachy Carey 
Publication date: 25 June 1992
Published in: Computers \& Operations Research (Search for Journal in Brave)
Recommendations
piecewise linear approximationpenalty function methodstaircase structurecongested networkconvex cost, linearly constrained, uncapacitated network flowpure processing networktime-varying flows
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)
Cites Work
- Title not available (Why is that?)
- Optimal Time-Varying Flows on Congested Networks
- Title not available (Why is that?)
- Title not available (Why is that?)
- Solving embedded generalized network problems
- Basis exchange characterizations for the simplex son algorithm for LP/embedded networks
- The simplex SON algorithm for LP/embedded network problems
- Nested decomposition for dynamic models
- Nested Decomposition and Multi-Stage Linear Programs
- Title not available (Why is that?)
- Title not available (Why is that?)
- A set of staircase linear programming test problems
- Congested network flows: Time-varying demands and start-time policies
- A Primal Simplex Approach to Pure Processing Networks
- Title not available (Why is that?)
- Computational comparison of two solution procedures for allocation/processing networks
- Title not available (Why is that?)
Cited In (4)
This page was built for publication: Extending and solving a multiperiod congested network flow model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1813833)
