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

DOI10.1016/j.apm.2009.10.026zbMath1193.90050MaRDI 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 methods; dynamic flows; network/graphs; LP problems

Mathematics Subject Classification ID

90C08: Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.)

90B10: Deterministic network models in operations research