Minimum cost flow problem on dynamic multi generative network flows

MaRDI QIDQ2867377zbMATH OpenFDO

Authors Seyed Ahmad Hosseini, Hassan Salehi Fathabadi

Publication date 11 December 2013

Published in Algorithmic Operations Research (Search for Journal in Brave)

Full work available at URL http://journals.hil.unb.ca/index.php/AOR/article/view/12411

zbMATH Keywords

decomposition methodsdynamic flowsLP problemsnetwork flowstime-commodity expanded network

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Recommendations

• An introduction to dynamic generative networks: minimum cost flow
• The minimum cost multicommodity flow problem in dynamic networks and an algorithm for its solving
• Maximum flow problem on dynamic generative network flows with time-varying bounds
• scientific article; zbMATH DE number 1918689
• Minimum cost multicommodity flows in dynamic networks and algorithms for their findings

Cited in

(9)

• Determining the optimal flows in zero-time dynamic networks
• The minimum cost multicommodity flow problem in dynamic networks and an algorithm for its solving
• A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs
• Dynamic flows with supply and demand in networks with several source and sink nodes
• A model-based approach and analysis for multi-period networks
• Minimum‐cost flow problems having arc‐activation costs
• An introduction to dynamic generative networks: minimum cost flow
• Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle
• Maximum flow problem on dynamic generative network flows with time-varying bounds

This page was built for publication: Minimum cost flow problem on dynamic multi generative network flows

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867377)