scientific article; zbMATH DE number 5211148

zbMath1136.90006MaRDI QIDQ5426803

Maria A. Fonoberova, Dmitrii D. Lozovanu

Publication date: 13 November 2007

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

network flowsdynamic minimum cost flow problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10)

Related Items (3)

Determining the optimal flows in zero-time dynamic networks ⋮ Algorithms for Finding Optimal Flows in Dynamic Networks ⋮ A polynomial time algorithm for the minimum flow problem in time-varying networks

This page was built for publication: