A network location-allocation model trading off flow capturing and p- median objectives
From MaRDI portal
Publication:689248
DOI10.1007/BF02060480zbMATH Open0781.90061OpenAlexW1979869601MaRDI QIDQ689248FDOQ689248
Authors: M. Hodgson, Kenneth E. Rosing
Publication date: 17 February 1994
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02060480
Recommendations
- scientific article; zbMATH DE number 1149819
- Flow intercepting facility location: Problems, models and heuristics
- Applying the flow-capturing location-allocation model to an authentic network: Edmonton, Canada
- A generalized model for locating facilities on a network with flow-based demand
- Deterministic flow-demand location problems
Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)
Cites Work
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- A Heuristic Algorithm for the Traveling Salesman Location Problem on Networks
- Multiobjective programming and planning
- A comparison of two dual-based procedures for solving the p-median problem
Cited In (11)
- Agent-based modelling of locating public transport facilities for conventional and electric vehicles
- Capacitated facility location/network design problems.
- An efficient heuristic algorithm for the alternative-fuel station location problem
- Location of organ procurement and distribution organisation decisions and their impact on kidney allocations: a developing country perspective
- Effects of multipurpose shopping trips on retail store location in a duopoly
- A reliable budget-constrained FL/ND problem with unreliable facilities
- A combined facility location and network design problem with multi-type of capacitated links
- A generalized model for locating facilities on a network with flow-based demand
- The flow-capturing location-allocation model with risk bottleneck limitation
- Applying the flow-capturing location-allocation model to an authentic network: Edmonton, Canada
- Filtering policies in loss queueing network location problems
This page was built for publication: A network location-allocation model trading off flow capturing and \(p\)- median objectives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q689248)