Efficient algorithms for minimum-cost flow problems with piecewise-linear convex costs

DOI10.1007/BF01240736zbMath0794.68071OpenAlexW1975879472MaRDI QIDQ1317479

Ron Shamir, Yaron Pinto

Publication date: 17 April 1994

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01240736

zbMATH Keywords

networksconvex costsstrongly polynomial algorithmsminimum-cost flowmultiple arcs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Communication networks in operations research (90B18) Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

Robust Appointment Scheduling with Heterogeneous Costs ⋮ Complexity and algorithms for nonlinear optimization problems

Cites Work

• A parametric algorithm for convex cost network flow and related problems
• A strongly polynomial minimum cost circulation algorithm
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Note—On the Merits of an “Approximation” to the Busy Period of the GI/G/1 Queue
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient algorithms for minimum-cost flow problems with piecewise-linear convex costs