Integer programming models for deployment of airport baggage screening security devices

Sheldon H. Jacobson, Laura A. McLay, Julie L. Virta, John E. Kobza

Research output: Contribution to journalArticlepeer-review


Aviation security is an important problem of national interest and concern. Baggage screening security devices and operations at airports throughout the United States provide an important defense against terrorist actions targeted at commercial aircraft. Determining where to deploy such devices, and how to best use them can be quite challenging. This paper presents NP-complete decision problems concerning the deployment and utilization of baggage screening security devices. These problems incorporate three different deployment performance measures: uncovered baggage segments, uncovered flight segments, and uncovered passenger segments. Integer programming models are formulated to address optimization versions of these problems and to identify optimal baggage screening security device deployments (i.e., determine the number and type of baggage screening security devices that should be placed at different airports, and determining which baggage should be screened with such devices). The models are illustrated with an example that incorporates data extracted from the Official Airline Guide (OAG).

Original languageEnglish (US)
Pages (from-to)339-359
Number of pages21
JournalOptimization and Engineering
Issue number3
StatePublished - Sep 2005


  • Aviation security
  • Cost analysis
  • Homeland security
  • Integer programming models
  • NP-completeness

ASJC Scopus subject areas

  • Software
  • Civil and Structural Engineering
  • Aerospace Engineering
  • Mechanical Engineering
  • Control and Optimization
  • Electrical and Electronic Engineering


Dive into the research topics of 'Integer programming models for deployment of airport baggage screening security devices'. Together they form a unique fingerprint.

Cite this