Combinatorial aspects of the sensor location problem

Lucio Bianco (), Giuseppe Confessore () and Monica Gentili ()

Annals of Operations Research, 2006, vol. 144, issue 1, 234 pages

Abstract: In this paper we address the Sensor Location Problem, that is the location of the minimum number of counting sensors, on the nodes of a network, in order to determine the arc flow volume of all the network. Despite the relevance of the problem from a practical point of view, there are very few contributions in the literature and no combinatorial analysis is performed to take into account particular structure of the network. We prove the problem is $$\cal N \cal P$$ -complete in different cases. We analyze special classes of graphs that are particularly interesting from an application point of view, for which we give low order polynomial solution algorithms. Copyright Springer Science+Business Media, LLC 2006

Keywords: Traffic problems; Combinatorial optimization; Complexity analysis; Graph theoretical approach (search for similar items in EconPapers)
Date: 2006
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (14)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-006-0016-9 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:144:y:2006:i:1:p:201-234:10.1007/s10479-006-0016-9

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-006-0016-9

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().