A Primal Algorithm to Solve Network Flow Problems with Convex Costs
From MaRDI portal
Publication:4082571
DOI10.1287/mnsc.21.1.87zbMath0319.90064OpenAlexW1993305973MaRDI QIDQ4082571
Publication date: 1974
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.21.1.87
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Related Items (9)
Local optimality conditions for multicommodity flow problems with separable piecewise convex costs ⋮ How to compute least infeasible flows ⋮ Minimum-cost flow algorithms: an experimental evaluation ⋮ Minimal-cost network flow problems with variable lower bounds on arc flows ⋮ Algorithms for the minimum cost circulation problem based on maximizing the mean improvement ⋮ Minimum ratio canceling in oracle polynomial for linear programming, but not strongly polynomial, even for networks ⋮ Maximum utility product pricing models and algorithms based on reservation price ⋮ A parametric algorithm for convex cost network flow and related problems ⋮ Spatial market equilibrium problems as network models
This page was built for publication: A Primal Algorithm to Solve Network Flow Problems with Convex Costs
