Locating flow-capturing units on a network with multi-counting and diminishing returns to scale
From MaRDI portal
Publication:1278239
DOI10.1016/0377-2217(94)00369-6zbMath0924.90100OpenAlexW1978443146MaRDI QIDQ1278239
Publication date: 14 November 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(94)00369-6
Related Items (8)
A lexicographic optimization approach to the deviation-flow refueling station location problem on a general network ⋮ Flow intercepting facility location: Problems, models and heuristics ⋮ A column generation approach for locating roadside clinics in Africa based on effectiveness and equity ⋮ A continuous network location problem for a single refueling station on a tree ⋮ A generalized model for locating facilities on a network with flow-based demand ⋮ An edge scanning method for the continuous deviation‐flow refueling station location problem on a general network ⋮ Exact Solution of the Evasive Flow Capturing Problem ⋮ Evasive flow capture: a multi-period stochastic facility location problem with independent demand
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Applying the flow-capturing location-allocation model to an authentic network: Edmonton, Canada
- An Analysis of Network Location Problems with Distance Constraints
- Optimal Location of Discretionary Service Facilities
- An analysis of approximations for maximizing submodular set functions—I
- Locating Discretionary Service Facilities, II: Maximizing Market Size, Minimizing Inconvenience
- Locating Discretionary Service Facilities Based on Probabilistic Customer Flows
- 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: Locating flow-capturing units on a network with multi-counting and diminishing returns to scale
