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

•A novel approach as Cut Optimization Problem (COP) for screen-line counter location problem (SLTCLP) based on graph cut without path enumeration.•Exact solution formulation without any heuristic algorithms.•Providing an exact solution within small computation cost even in the large networks.•Illust...

Celý popis

Podrobná bibliografia

Vydané v:	Expert systems with applications Ročník 275; s. 127000
Hlavní autori:	Sase, Ruri, Sugiura, Satoshi, Chen, Anthony
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Ltd 25.05.2025
Predmet:	Graph cut Mixed-integer linear programming problem Screen-line traffic counting location problem Mixed-integer linear programming problem Graph cut Screen-line traffic counting location problem
ISSN:	0957-4174
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!