Updating network flows given multiple, heterogeneous arc attribute changes

DOI10.1007/s10852-010-9129-xzbMath1229.90030OpenAlexW1994098060MaRDI QIDQ655194

Hao Tang, Zhiying Chen, Elise D. Miller-Hooks

Publication date: 2 January 2012

Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10852-010-9129-x

zbMATH Keywords

evacuationreoptimizationdynamic pathsminimum cost flows

Mathematics Subject Classification ID

Applications of graph theory (05C90) Deterministic network models in operations research (90B10)

Uses Software

• MCFClass
• RELAX4

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dynamic programming and stochastic control
• Reoptimization procedures for bounded variable primal simplex network algorithms
• A reoptimization algorithm for the shortest path problem with time windows
• On solving quickest time problems in time-dependent, dynamic networks
• Simultaneous lotsizing and scheduling by combining local search with dual reoptimization
• A Computational Study of Cost Reoptimization for Min-Cost Flow Problems
• Dual Algorithms for Pure Network Problems
• New Methods in Mathematical Programming—Optimal Flow Through Networks with Gains
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Network Reoptimization Algorithms: A Statistically Designed Comparison
• A Faster Strongly Polynomial Minimum Cost Flow Algorithm
• Time-varying minimum cost flow problems