Graph decomposition based adaptive time-stepping framework for dynamic minimum cost flow

doi:10.1016/j.eswa.2026.131419

Graph decomposition based adaptive time-stepping framework for dynamic minimum cost flow

2026-01-30

0

PRE

AI

DOI：10.1016/j.eswa.2026.131419

Original

Original request for help

Save

Abstract

En 中文

• PDIAM integrates decomposition, adaptive search and online robust optimization • Duality-based model casts minimax flow as tractable LP with uncertainty budget • Decomposition isolates disturbances, adaptive search escapes local optima real time • Simulations on CSTK and real-data show 25.7%+ 1.3% cost savings

Graph decomposition based adaptive time-stepping framework for dynamic minimum cost flow

Abstract

Journal

Organization