Computational complexity analysis of the sensor location flow observability problem

Monica Gentili; Pitu Mirchandani

doi:10.1007/s11590-014-0731-0

Computational complexity analysis of the sensor location flow observability problem

Monica Gentili, Pitu Mirchandani

Research output: Contribution to journal › Article › peer-review

5 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 language	English (US)
Pages (from-to)	2245-2259
Number of pages	15
Journal	Optimization Letters
Volume	8
Issue number	8
DOIs	https://doi.org/10.1007/s11590-014-0731-0
State	Published - Nov 19 2014

Keywords

Computational complexity
Sensor location
Traffic network

ASJC Scopus subject areas

Control and Optimization

Access to Document

10.1007/s11590-014-0731-0

Cite this

@article{4045f76dfb9b42f9a427e359166a31b1,

title = "Computational complexity analysis of the sensor location flow observability problem",

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.",

keywords = "Computational complexity, Sensor location, Traffic network",

author = "Monica Gentili and Pitu Mirchandani",

note = "Publisher Copyright: {\textcopyright} 2014, Springer-Verlag Berlin Heidelberg.",

year = "2014",

month = nov,

day = "19",

doi = "10.1007/s11590-014-0731-0",

language = "English (US)",

volume = "8",

pages = "2245--2259",

journal = "Optimization Letters",

issn = "1862-4472",

publisher = "Springer Verlag",

number = "8",

}

TY - JOUR

T1 - Computational complexity analysis of the sensor location flow observability problem

AU - Gentili, Monica

AU - Mirchandani, Pitu

PY - 2014/11/19

Y1 - 2014/11/19

N2 - 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.

AB - 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.

KW - Computational complexity

KW - Sensor location

KW - Traffic network

UR - http://www.scopus.com/inward/record.url?scp=84911991154&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84911991154&partnerID=8YFLogxK

U2 - 10.1007/s11590-014-0731-0

DO - 10.1007/s11590-014-0731-0

M3 - Article

AN - SCOPUS:84911991154

SN - 1862-4472

VL - 8

SP - 2245

EP - 2259

JO - Optimization Letters

JF - Optimization Letters

IS - 8

ER -

Computational complexity analysis of the sensor location flow observability problem

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this