Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

Exact and Heuristics Algorithms for Screen Line Problem in Large Size Networks: Shortest Path-Based Column Generation Approach

16 references·1 citing·30 second hop

FromToDepth

this work references cited by second hop

References

1984Estimation of trip matrices from traffic counts and survey data: A generalized least squares estimator500 cited
2000Algorithms for the Set Covering Problem432 cited
1987A maximum likelihood model for estimating origin-destination matrices310 cited
1998Optimal traffic counting locations for origin–destination matrix estimation308 cited
2007Trip matrix and path flow reconstruction and estimation based on plate scanning and link observations210 cited
1991An analysis of the reliability of an origin-destination trip matrix estimated from traffic counts177 cited
2001A Network Based Model for Traffic Sensor Location with Implications on O/D Matrix Estimates175 cited
2005The optimisation of traffic count locations in road networks136 cited
2009Optimal traffic plate scanning location for OD trip matrix and route estimation in road networks135 cited
2015Towards a generic benchmarking platform for origin–destination flows estimation/updating algorithms: Design, demonstration and validation128 cited
2008The Observability Problem in Traffic Network Models125 cited
2004Models and algorithms for the screen line-based traffic-counting location problems123 cited
2008Traffic Estimation and Optimal Counting Location Without Path Enumeration Using Bayesian Networks122 cited
2012Synergistic sensor location for link flow inference without path enumeration: A node-based approach

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work

109 cited

2002The total demand scale: a new measure of quality for static and dynamic origin–destination trip tables99 cited

2014Assessing partial observability in network sensor location problems95 cited

Cited by

2025Optimized graph-cut approach for the screen-line traffic counting location problem: An exact and efficient solution method4 cited