An approximation algorithm for discrete minimum cost flows over time problem

DOI10.1504/IJOR.2014.061773zbMath1362.90118MaRDI QIDQ2627510

Ali Ebrahimnejad, Reza Rostami

Publication date: 31 May 2017

Published in: International Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

modellingapproximation algorithmoperational researchflows over timeminimum cost flow problemnetwork flow models

Mathematics Subject Classification ID

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

Related Items

A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs