Maximum flow problem on dynamic generative network flows with time-varying bounds

DOI10.1016/j.apm.2009.10.026zbMath1193.90050OpenAlexW2093348135MaRDI QIDQ988972

J. Martínez

Publication date: 27 August 2010

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

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

zbMATH Keywords

decomposition methodsdynamic flowsnetwork/graphsLP problems

Mathematics Subject Classification ID

Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Deterministic network models in operations research (90B10)

Related Items

Determining the optimal flows in zero-time dynamic networks, An introduction to dynamic generative networks: minimum cost flow, Minimum flow problem on network flows with time-varying bounds, Unnamed Item, A feasibility evaluation approach for time-evolving multi-item production–distribution networks

Cites Work

• A survey of dynamic network flows
• Universally maximum flow with piecewise-constant capacities
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item