Skip to main navigation Skip to search Skip to main content

A bi-objective MIP model for the dynamic gaming case of the R-interdiction median problem with fortification

  • Beihang University

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In this paper we study a general Attack-Defense gaming case of the R-Interdiction Median problem with Fortification (AD-RIMF in short), which is very important for critical infrastructures/facilities protection in many fields. A bi-objective mathematical model is presented to describe the gaming process of the AD-RIMF problem by considering expectations from both designer and attacker who pursue the same cost objective function but in the opposite direction. We give some theoretical analysis on the optimal solution of the AD-RIMF problem, and propose a general solution approach. Computational test is done to illustrate the proposed model and solution approach.

Original languageEnglish
Title of host publicationConference Proceedings of the 4th International Symposium on Project Management, ISPM 2016
EditorsXi Shen Cao, Henry Zhang, Chang Bo Cheng
PublisherAussino Academic Publishing House
Pages899-908
Number of pages10
ISBN (Electronic)9781921712487
StatePublished - 2016
Event4th International Symposium on Project Management, ISPM 2016 - Wuhan, China
Duration: 9 Jul 201610 Jul 2016

Publication series

NameConference Proceedings of the 4th International Symposium on Project Management, ISPM 2016

Conference

Conference4th International Symposium on Project Management, ISPM 2016
Country/TerritoryChina
CityWuhan
Period9/07/1610/07/16

Keywords

  • Dynamic programming
  • Facility location
  • Game
  • RIMF

Fingerprint

Dive into the research topics of 'A bi-objective MIP model for the dynamic gaming case of the R-interdiction median problem with fortification'. Together they form a unique fingerprint.

Cite this