Locating flow-capturing units on a network with multi-counting and diminishing returns to scale
type: Item
instance of: scholarly article
title: Locating flow-capturing units on a network with multi-counting and diminishing returns to scale
zbMATH Open document ID: 0924.90100
DOI: 10.1016/0377-2217(94)00369-6
author: Igor Averbakh
author: Oded Berman
published in: European Journal of Operational Research
publication date: 1999-11-14T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 1252856
zbMATH Keywords: location
zbMATH Keywords: facilities
zbMATH Keywords: complexity
zbMATH Keywords: heuristics
zbMATH Keywords: transportation network
MaRDI profile type: Publication
full work available at URL: 0377-2217(94)00369-6
OpenAlex ID: W1978443146
cites work: Locating Discretionary Service Facilities, II: Maximizing Market Size, Minimizing Inconvenience
cites work: Locating Discretionary Service Facilities Based on Probabilistic Customer Flows
cites work: Optimal Location of Discretionary Service Facilities
cites work: Q3993417
cites work: Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
cites work: Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
cites work: Applying the flow-capturing location-allocation model to an authentic network: Edmonton, Canada
cites work: Q3971521
cites work: An Analysis of Network Location Problems with Distance Constraints
cites work: An analysis of approximations for maximizing submodular set functions—I
cites work: Q4739657
description: scientific article; zbMATH DE number 1252856