We propose a new approach based DC programming for fnding a solution of the
partial facility interdiction problem that belongs to the class of bilevel programming. This
model was frst considered in the work of Aksen et al. [1] with a heuristic algorithm named
multi-start simplex search (MSS). However, because of the big number of the subproblems
called during the search, the running time of MSS increases rapidly as the number of facilities
grows. To overcome this limitation, our new algorithm based DC programming is able to
shorten the computation time signifcantly, especially for the case of high number of nodes.
This efciency is illustrated by numerical experiments for a lot of test instances up to 20 facilities.