A parametric algorithm for convex cost network flow and related problems-Reference-Cited by-同舟云学术

A parametric algorithm for convex cost network flow and related problems

Published:1984-05 Issue:2 Volume:16 Page:222-235
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Ahuja R.K.,Batra J.L.,Gupta S.K.

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference27 articles.

1. An algorithm for optimizing network flow capacity under economies of scale;Bansal;J. Optimization Theory Appl.,1975

2. An algorithm for solving the transportation problem when the shipping cost over each route is convex;Beale;Naval Res. Logist. Quart.,1959

3. Linear programming under uncertainity;Dantzig;Management Sci.,1955

4. Linear Programming and Extensions;Dantzig,1963

5. Water Supply and Waste-Water Disposal;Fair,1954

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Min-Deviation-Flow in Bi-directed Graphs for T-Mesh Quantization;ACM Transactions on Graphics;2023-07-26

2. Flows of Substances in Networks and Network Channels: Selected Results and Applications;Entropy;2022-10-18

3. Parametric Computation of Minimum-Cost Flows with Piecewise Quadratic Costs;Mathematics of Operations Research;2021-09-14

4. A linear time algorithm for the unbalanced Hitchcock transportation problem;Networks;2015-12-24

5. Complexity and algorithms for nonlinear optimization problems;Annals of Operations Research;2007-05-03