On Max Flows with Gains and Pure Min-Cost Flows

DOI10.1137/0132037zbMath0352.90069OpenAlexW2077623661MaRDI QIDQ4123107

Klaus Truemper

Publication date: 1977

Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0132037

Mathematics Subject Classification ID

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

Related Items (9)

A faster combinatorial approximation algorithm for scheduling unrelated parallel machines ⋮ Distributive lattices, polyhedra, and generalized flows ⋮ Multi-commodity flow problem on lossy network with partial lane reversals ⋮ A Strongly Polynomial Algorithm for Generalized Flow Maximization ⋮ Lot sizing with inventory gains ⋮ A simple GAP-canceling algorithm for the generalized maximum flow problem ⋮ Maximum outflow in generalized flow networks ⋮ A parametric algorithm for convex cost network flow and related problems ⋮ Convex generalized flows

This page was built for publication: On Max Flows with Gains and Pure Min-Cost Flows