Abstract
We study the r-interdiction median problem with fortification (RIMF), which considers demand points that are served by facilities. If a facility is interdicted, it can not serve any demand point, increasing the total system cost. To avoid an interdiction, a facility can be fortified. The problem consists of fortifying facilities knowing that some facilities will be interdicted. We propose a branch-and-cut algorithm for the RIMF and several experiments attest that our method outperforms the best exact algorithm found.
Subject
Management Science and Operations Research,Computer Science Applications,Theoretical Computer Science
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献