Computational complexity analysis of the sensor location flow observability problem

Monica Gentili, Pitu Mirchandani

Research output: Contribution to journalArticle

1 Scopus citations

Abstract

The sensor location flow observability problem is studied from the computational complexity point of view. Although the general problem is shown to be NP-complete, by studying the special cases of input matrix structures and data where the corresponding problems are polynomially solvable, the boundary between NP-complete and polynomial solvable problems is delineated.

Original languageEnglish (US)
Pages (from-to)2245-2259
Number of pages15
JournalOptimization Letters
Volume8
Issue number8
DOIs
StatePublished - Nov 19 2014

Keywords

  • Computational complexity
  • Sensor location
  • Traffic network

ASJC Scopus subject areas

  • Control and Optimization

Fingerprint Dive into the research topics of 'Computational complexity analysis of the sensor location flow observability problem'. Together they form a unique fingerprint.

  • Cite this