An introduction to dynamic generative networks: minimum cost flow
type: Item
instance of: scholarly article
title: An introduction to dynamic generative networks: minimum cost flow
zbMATH Open document ID: 1228.90017
author: Juan-Miguel Gracia
published in: Applied Mathematical Modelling
publication date: 2011-12-18T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 90C48
zbMATH DE Number: 5989325
zbMATH Keywords: optimization
zbMATH Keywords: network/graphs
zbMATH Keywords: linear programming
zbMATH Keywords: decomposition methods
MaRDI profile type: Publication
full work available at URL: j.apm.2011.04.009
OpenAlex ID: W2080853301
cites work: Q5514188
cites work: Efficient continuous-time dynamic network flow algorithms
cites work: A Dynamic Network Flow Problem with Uncertain arc Capacities: Formulation and Problem Structure
cites work: Universally maximum flow with piecewise-constant capacities
cites work: Faster algorithms for the quickest transshipment problem
cites work: The quickest transshipment problem
cites work: A survey of dynamic network flows
cites work: Optimal Flows in Dynamic Networks and Algorithms for their Finding
cites work: Maximum flow problem on dynamic generative network flows with time-varying bounds
cites work: Constructing Maximal Dynamic Flows from Static Flows
cites work: Q3056948
cites work: Q3998396
cites work: The Decomposition Algorithm for Linear Programs
cites work: Decomposition Principle for Linear Programs
cites work: A multicommodity network-flow problem with side constraints on paths solved by column generation
DOI: 10.1016/J.APM.2011.04.009
description: scientific article; zbMATH DE number 5989325