arrow
Return

Cell partition-based methods for stochastic shortest-path interdiction problems

delete2026-10-01
delete0
delete
OA
AI
D
Di H. Nguyen *
Y
Yongjia Song
DOI:10.1016/j.ejco.2026.100146delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
• Explored a single-cut formulation and a global lower bound for cell partition-based framework for the Stochastic Shortest Path Interdiction problems. • Evaluated the single-cut approach against existing multi-cut approaches. • Developed structure-exploiting strategies to enhance computational performances. • Yielded significant computational improvements over existing approaches.
Keywords:
Partition-based method
Network interdiction
Stochastic programming

Journal

EURO Journal on Computational Optimization cover
EURO Journal on Computational Optimization
IF:
1.7
Papers:
63
Citations:
391

Organization

C
Clemson University
Scholars:
354
Papers: 146
Citations: 0
U
University College Dublin
Scholars:
521
Papers: 242
Citations: 0
Cited Papers

Cited Papers

No cited papers available