An introduction to dynamic generative networks: minimum cost flow

DOI10.1016/j.apm.2011.04.009zbMath1228.90017OpenAlexW2080853301MaRDI QIDQ651703

Juan-Miguel Gracia

Publication date: 18 December 2011

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2011.04.009

zbMATH Keywords

optimizationlinear programmingdecomposition methodsnetwork/graphs

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Programming in abstract spaces (90C48) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

A model-based approach and analysis for multi-period networks, Determining the optimal flows in zero-time dynamic networks, Time-dependent optimization of a multi-item uncertain supply chain network: a hybrid approximation algorithm, A decomposition-based approach for the multiperiod multiproduct distribution planning problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey of dynamic network flows
• Maximum flow problem on dynamic generative network flows with time-varying bounds
• Efficient continuous-time dynamic network flow algorithms
• Faster Algorithms for the Quickest Transshipment Problem
• The Quickest Transshipment Problem
• Universally maximum flow with piecewise-constant capacities
• A Multicommodity Network-Flow Problem with Side Constraints on Paths Solved by Column Generation
• Optimal Flows in Dynamic Networks and Algorithms for their Finding
• Decomposition Principle for Linear Programs
• The Decomposition Algorithm for Linear Programs
• A Dynamic Network Flow Problem with Uncertain arc Capacities: Formulation and Problem Structure
• Constructing Maximal Dynamic Flows from Static Flows