.png){kind=icon}
Return
Graph decomposition based adaptive time-stepping framework for dynamic minimum cost flow
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2026.131419.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
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
Journal
IF:
7.5
Papers:
3.0W
Citations:
10.2W
Organization
Cited Papers
ShareSaveA reinforcement learning approach for reducing traffic congestion using deep Q learning.png)
SCIENTIFIC REPORTS
OAAI
SCIENTIFIC REPORTSIF3.9
OAAIShareSaveShareSave
ShareSave
View more