An exact algorithm for solving the bilevel facility interdiction and fortification problem |
| |
Authors: | Kaiyue Zheng Laura A Albert |
| |
Institution: | 1. FICO, United States;2. Department of Industrial and Systems Engineering, University of Wisconsin-Madison, 1513 University Avenue, Madison, WI 53562, USA |
| |
Abstract: | We present an exact approach for solving the -interdiction median problem with fortification. Our approach consists of solving a greedy heuristic and a set cover problem iteratively that guarantees to find an optimal solution upon termination. The greedy heuristic obtains a feasible solution to the problem, and the set cover problem is solved to verify optimality of the solution and to provide a direction for improvement if not optimal. We demonstrate the performance of the algorithm in a computational study. |
| |
Keywords: | Network interdiction Bilevel facility location Facility interdiction and fortification Set cover algorithms |
本文献已被 ScienceDirect 等数据库收录! |