Flow intercepting facility location: Problems, models and heuristics
From MaRDI portal
Publication:841607
DOI10.1007/S10852-008-9098-5zbMATH Open1178.90215OpenAlexW2068437057MaRDI QIDQ841607FDOQ841607
Authors: Maurizio Boccia, Claudio Sterle, Antonio 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
Recommendations
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Cites Work
- Title not available (Why is that?)
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- The budgeted maximum coverage problem
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- A Network Based Model for Traffic Sensor Location with Implications on O/D Matrix Estimates
- Optimal Location of Discretionary Service Facilities
- Locating Discretionary Service Facilities, II: Maximizing Market Size, Minimizing Inconvenience
- Models and algorithms for the screen line-based traffic-counting location problems
- Locating active sensors on traffic networks
- Locating flow-capturing units on a network with multi-counting and diminishing returns to scale
- Deterministic flow-demand location problems
- Title not available (Why is that?)
- The Inspection Station Location Problem In Hazardous Material Transportation: Some Heuristics And Bounds
- Locating flow-intercepting facilities: New approaches and results
- Algorithms for Path-Based Placement of Inspection Stations on Networks
Cited In (12)
- The multi terminal \(q\)-FlowLoc problem: a heuristic
- Bi-level programming model and hybrid genetic algorithm for flow interception problem with customer choice
- A unified solving approach for two and three dimensional coverage problems in sensor networks
- Evasive flow capture: optimal location of weigh-in-motion systems, tollbooths, and security checkpoints
- Locating flow-intercepting facilities: New approaches and results
- A network location-allocation model trading off flow capturing and \(p\)- median objectives
- Deterministic flow-demand location problems
- An effective bilevel programming approach for the evasive flow capturing location problem
- A generalized model for locating facilities on a network with flow-based demand
- Multi-commodity location-routing: flow intercepting formulation and branch-and-cut algorithm
- Title not available (Why is that?)
- Optimal shrinking of the distribution chain: the facilities delocation decision
This page was built for publication: Flow intercepting facility location: Problems, models and heuristics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q841607)