Minimum Convex Cost Dynamic Network Flows

DOI10.1287/moor.9.2.190zbMath0568.90028OpenAlexW2163534333MaRDI QIDQ3685538

James B. Orlin

Publication date: 1984

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/514e26ba06edfd75b7cb73040d700a2ce9b2dafd

zbMATH Keywords

dynamic flowfinite directed networkinfinite horizon integer programmingminimum convex cost flownetwork flows evolving over time

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Integer programming (90C10) Deterministic network models in operations research (90B10) Paths and cycles (05C38)

Related Items (12)

Optimal distribution strategies with cyclic demands ⋮ A continuous-time average-cost flexible manufacturing and operator scheduling model solved by deconvexification over time ⋮ A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs ⋮ Minimum cost dynamic flows: The series-parallel case ⋮ Minimum‐cost flow problems having arc‐activation costs ⋮ Minimal-cost network flow problems with variable lower bounds on arc flows ⋮ A survey of dynamic network flows ⋮ Unnamed Item ⋮ Universally maximum flow with piecewise-constant capacities ⋮ Time-varying minimum cost flow problems ⋮ Minimization of circuit registers: Retiming revisited ⋮ One, two, three, many, or: Complexity aspects of dynamic network flows with dedicated arcs

This page was built for publication: Minimum Convex Cost Dynamic Network Flows