Experimental evaluation of approximation and heuristic algorithms for the dominating paths problem
From MaRDI portal
Publication:1772870
DOI10.1016/J.COR.2004.03.008zbMath1116.90407OpenAlexW1974207419MaRDI QIDQ1772870
Giuseppe Confessore, Monica Gentili, Paolo Dell'Olmo
Publication date: 21 April 2005
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2004.03.008
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Approximation algorithms (68W25)
Related Items (3)
Locating sensors to observe network arc flows: exact and heuristic approaches ⋮ Dimensionality reduction in multiobjective shortest path search ⋮ Computational complexity analysis of the sensor location flow observability problem
Cites Work
- Unnamed Item
- Combinatorial aspects of the sensor location problem
- Optimal Location of Discretionary Service Facilities
- A Network Based Model for Traffic Sensor Location with Implications on O/D Matrix Estimates
- The Inspection Station Location Problem In Hazardous Material Transportation: Some Heuristics And Bounds
- Locating Discretionary Service Facilities Based on Probabilistic Customer Flows
This page was built for publication: Experimental evaluation of approximation and heuristic algorithms for the dominating paths problem
