Network location problems with continuous link demands: p-medians on a chain and 2-medians on a tree
type: Item
instance of: scholarly article
title: Network location problems with continuous link demands: p-medians on a chain and 2-medians on a tree
zbMATH Open document ID: 0579.90025
DOI: 10.1016/0377-2217(86)90244-4
author: Tom M. Cavalier
author: Hanif D. Sherali
published in: European Journal of Operational Research
publication date: 1986-01-01T00:00:00Z
Mathematics Subject Classification ID: 90B05
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 3928679
zbMATH Keywords: minisum location-allocation problems
zbMATH Keywords: undirected networks
zbMATH Keywords: chain graph
zbMATH Keywords: p-median
zbMATH Keywords: tree-network
MaRDI profile type: Publication
full work available at URL: 0377-2217(86)90244-4
OpenAlex ID: W1991190245
cites work: The minisum location problem on an undirected network with continuous link demands
cites work: Optimal location of a facility relative to area demands
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: Q3316922
cites work: An Algorithmic Approach to Network Location Problems. II: Thep-Medians
cites work: An Algorithmic Approach to Network Location Problems. I: Thep-Centers
cites work: The Centers and Medians of a Graph
cites work: Q3863425
cites work: Localizing 2‐medians on probabilistic and deterministic tree networks
cites work: On Locating a Facility to Service Areas within a Network
cites work: Locating Centers on a Tree with Discontinuous Supply and Demand Regions
description: scientific article; zbMATH DE number 3928679