A Primal Algorithm to Solve Network Flow Problems with Convex Costs

DOI10.1287/MNSC.21.1.87zbMATH Open0319.90064OpenAlexW1993305973MaRDI QIDQ4082571FDOQ4082571

Authors: Andrés Weintraub 

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Cited In (9)

• 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-cost flow algorithms: an experimental evaluation
• Spatial market equilibrium problems as network models
• Minimum ratio canceling in oracle polynomial for linear programming, but not strongly polynomial, even for networks
• How to compute least infeasible flows
• Maximum utility product pricing models and algorithms based on reservation price
• Local optimality conditions for multicommodity flow problems with separable piecewise convex costs
• A parametric algorithm for convex cost network flow and related problems

This page was built for publication: A Primal Algorithm to Solve Network Flow Problems with Convex Costs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4082571)