Computational complexity analysis of the sensor location flow observability problem

DOI10.1007/s11590-014-0731-0zbMath1308.90089OpenAlexW2021202745MaRDI QIDQ479256

Monica Gentili, Pitu B. Mirchandani

Publication date: 5 December 2014

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-014-0731-0

zbMATH Keywords

computational complexitysensor locationtraffic network

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)

Related Items (1)

An iterative multiparametric approach for determining the location of AVI sensors for robust route flow estimation

Cites Work

• Unnamed Item
• Locating active sensors on traffic networks
• Combinatorial aspects of the sensor location problem
• Geometric algorithms and combinatorial optimization
• A linear algorithm for the domination number of a tree
• The minimum labeling spanning trees
• Experimental evaluation of approximation and heuristic algorithms for the dominating paths problem
• Local search for the minimum label spanning tree problem with bounded color classes.
• Minimizing submodular functions over families of sets
• Some New Matroids on Graphs: Cut Sets and the Max Cut Problem
• An analysis of approximations for maximizing submodular set functions—I
• Spanning trees with many or few colors in edge-colored graphs
• A Network Based Model for Traffic Sensor Location with Implications on O/D Matrix Estimates
• Reducibility among Combinatorial Problems

This page was built for publication: Computational complexity analysis of the sensor location flow observability problem