A parametric algorithm for convex cost network flow and related problems
- 31 May 1984
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 16 (2), 222-235
- https://doi.org/10.1016/0377-2217(84)90076-6
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Solving the Project Time/Cost Tradeoff Problem Using the Minimal Cut ConceptManagement Science, 1977
- On Max Flows with Gains and Pure Min-Cost FlowsSIAM Journal on Applied Mathematics, 1977
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network ProblemsManagement Science, 1974
- A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation ProblemsManagement Science, 1967
- Optimum flows in general communication networksJournal of the Franklin Institute, 1967
- Minimum‐cost flows in convex‐cost networksNaval Research Logistics Quarterly, 1966
- The minimal cost flow problem with convex costsNaval Research Logistics Quarterly, 1965
- An algorithm for solving the transportation problem when the shipping cost over each route is convexNaval Research Logistics Quarterly, 1959
- The Allocation of Aircraft to Routes—An Example of Linear Programming Under Uncertain DemandManagement Science, 1956
- Linear Programming under UncertaintyManagement Science, 1955