Minimum cost time-varying network flow problems

DOI10.1080/10556780903239121zbMath1189.90018OpenAlexW1982800744MaRDI QIDQ3562412

Ebrahim Nasrabadi, S. Mehdi Hashemi

Publication date: 21 May 2010

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556780903239121

zbMATH Keywords

network flowstime-varying networksminimum cost dynamic flowshortest dynamic path

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Inventory, storage, reservoirs (90B05)

Related Items (7)

Efficient contraflow algorithms for quickest evacuation planning ⋮ Minimum parametric flow in time-dependent dynamic networks ⋮ A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs ⋮ The cross-entropy method for solving bi-criteria network flow problems in discrete-time dynamic networks ⋮ On solving continuous-time dynamic network flows ⋮ Flows over time in time-varying networks: optimality conditions and strong duality ⋮ Unnamed Item

This page was built for publication: Minimum cost time-varying network flow problems