Flow intercepting facility location: Problems, models and heuristics
From MaRDI portal
Publication:841607
DOI10.1007/S10852-008-9098-5zbMath1178.90215OpenAlexW2068437057MaRDI QIDQ841607
Claudio Sterle, Maurizio Boccia, Aantonio Sforza
Publication date: 18 September 2009
Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10852-008-9098-5
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (4)
A unified solving approach for two and three dimensional coverage problems in sensor networks ⋮ Multi-commodity location-routing: flow intercepting formulation and branch-and-cut algorithm ⋮ An effective bilevel programming approach for the evasive flow capturing location problem ⋮ Optimal shrinking of the distribution chain: the facilities delocation decision
Cites Work
- Unnamed Item
- Unnamed Item
- Locating active sensors on traffic networks
- Locating flow-capturing units on a network with multi-counting and diminishing returns to scale
- The budgeted maximum coverage problem
- Locating flow-intercepting facilities: New approaches and results
- Models and algorithms for the screen line-based traffic-counting location problems
- Optimal Location of Discretionary Service Facilities
- Deterministic flow-demand location problems
- A Network Based Model for Traffic Sensor Location with Implications on O/D Matrix Estimates
- Algorithms for Path-Based Placement of Inspection Stations on Networks
- The Inspection Station Location Problem In Hazardous Material Transportation: Some Heuristics And Bounds
- Locating Discretionary Service Facilities, II: Maximizing Market Size, Minimizing Inconvenience
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
This page was built for publication: Flow intercepting facility location: Problems, models and heuristics