Deterministic flow-demand location problems
From MaRDI portal
Recommendations
- Flow intercepting facility location: Problems, models and heuristics
- scientific article; zbMATH DE number 1803764
- scientific article; zbMATH DE number 2152473
- Exact Solution to a Location Problem with Stochastic Demands
- scientific article; zbMATH DE number 1353813
- Minimum cost source location problems with flow requirements
- Minimum Cost Source Location Problems with Flow Requirements
- A generalized model for locating facilities on a network with flow-based demand
- Network flow assignment as a fixed point problem
- Efficient solution of a class of location-allocation problems with stochastic demand and congestion
Cited in
(13)- Distributions of rectilinear deviation distance to visit a facility
- Generalized flow-interception facility location models with probabilistic customer flows
- Maximizing expected coverage of flow and opportunity for diversion in networked systems
- Maximum flow-covering location and service start time problem and its application to Tokyo metropolitan railway network
- An efficient heuristic algorithm for the alternative-fuel station location problem
- A network location-allocation model trading off flow capturing and \(p\)- median objectives
- A generalized model for locating facilities on a network with flow-based demand
- Optimal location and opening hours of a single facility which maximally cover flows in a circular city
- Flow intercepting facility location: Problems, models and heuristics
- A continuous network location problem for a single refueling station on a tree
- Deviation distance and sufficient density of alternative fuel stations
- On covering location problems on networks with edge demand
- Location coverage models with demand originating from nodes and paths: Application to cellular network design
This page was built for publication: Deterministic flow-demand location problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4345520)
