Network interdiction with asymmetric cost uncertainty

•This research focuses on a variant of shortest-path interdiction problems.•The interdictor may not have perfect information on data.•A bounding-and-partitioning approach can solve expected-value interdiction problems.•Computation time depends mostly on the number of uncertain arcs.