Maximum flow problem on dynamic generative network flows with time-varying bounds
type: Item
instance of: scholarly article
title: Maximum flow problem on dynamic generative network flows with time-varying bounds
zbMATH Open document ID: 1193.90050
author: J. Martínez
published in: Applied Mathematical Modelling
publication date: 2010-08-27T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C08
zbMATH DE Number: 5775618
zbMATH Keywords: network/graphs
zbMATH Keywords: dynamic flows
zbMATH Keywords: LP problems
zbMATH Keywords: decomposition methods
MaRDI profile type: Publication
full work available at URL: j.apm.2009.10.026
OpenAlex ID: W2093348135
cites work: A survey of dynamic network flows
cites work: Q5687194
cites work: Q3292914
cites work: Optimal Flows in Dynamic Networks and Algorithms for their Finding
cites work: Universally maximum flow with piecewise-constant capacities
cites work: A Dynamic Network Flow Problem with Uncertain arc Capacities: Formulation and Problem Structure
cites work: Q3056948
cites work: Q3998396
cites work: Decomposition Principle for Linear Programs
cites work: The Decomposition Algorithm for Linear Programs
cites work: Q5338598
cites work: Q3844775
DOI: 10.1016/J.APM.2009.10.026
description: scientific article; zbMATH DE number 5775618