A branch-and-cut algorithm for the multiple allocation r-hub interdiction median problem with fortification

作者：

Highlights：

• New ILP formulation with a polynomial number of variables.

• The branch-and-cut algorithm was proved to be robust, solving all instances.

• Computational results overcome the best exact method found in the literature.

• Several open instances are solved for the first time.

摘要

•New ILP formulation with a polynomial number of variables.•The branch-and-cut algorithm was proved to be robust, solving all instances.•Computational results overcome the best exact method found in the literature.•Several open instances are solved for the first time.

论文关键词：Bilevel problem,Hub fortification,Hub interdiction,Branch-and-cut

论文评审过程：Received 13 January 2018, Revised 7 May 2018, Accepted 30 May 2018, Available online 5 June 2018, Version of Record 18 June 2018.

论文官网地址：https://doi.org/10.1016/j.eswa.2018.05.036